/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-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:01:28,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:01:28,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:01:28,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:01:28,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:01:28,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:01:28,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:01:28,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:01:28,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:01:28,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:01:28,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:01:28,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:01:28,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:01:28,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:01:28,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:01:28,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:01:28,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:01:28,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:01:28,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:01:28,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:01:28,645 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:01:28,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:01:28,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:01:28,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:01:28,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:01:28,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:01:28,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:01:28,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:01:28,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:01:28,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:01:28,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:01:28,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:01:28,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:01:28,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:01:28,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:01:28,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:01:28,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:01:28,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:01:28,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:01:28,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:01:28,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:01:28,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:01:28,670 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:01:28,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:01:28,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:01:28,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:01:28,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:01:28,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:01:28,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:01:28,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:01:28,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:01:28,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:01:28,683 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:01:28,683 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:01:28,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:01:28,683 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:01:28,683 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:01:28,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:01:28,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:01:28,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:01:28,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:01:28,940 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:01:28,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-08 10:01:28,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955441966/9f86339af8c5426da70bad65731cedb5/FLAG57568671b [2022-04-08 10:01:29,317 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:01:29,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-08 10:01:29,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955441966/9f86339af8c5426da70bad65731cedb5/FLAG57568671b [2022-04-08 10:01:29,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955441966/9f86339af8c5426da70bad65731cedb5 [2022-04-08 10:01:29,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:01:29,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:01:29,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:01:29,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:01:29,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:01:29,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29, skipping insertion in model container [2022-04-08 10:01:29,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:01:29,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:01:29,471 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-de20.c[368,381] [2022-04-08 10:01:29,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:01:29,518 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:01:29,525 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-de20.c[368,381] [2022-04-08 10:01:29,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:01:29,539 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:01:29,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29 WrapperNode [2022-04-08 10:01:29,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:01:29,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:01:29,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:01:29,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:01:29,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:01:29,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:01:29,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:01:29,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:01:29,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (1/1) ... [2022-04-08 10:01:29,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:01:29,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:29,598 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:01:29,613 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:01:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:01:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:01:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:01:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:01:29,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:01:29,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:01:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:01:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:01:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:01:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:01:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:01:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:01:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:01:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:01:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:01:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:01:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:01:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:01:29,688 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:01:29,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:01:29,809 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:01:29,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:01:29,814 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 10:01:29,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:01:29 BoogieIcfgContainer [2022-04-08 10:01:29,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:01:29,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:01:29,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:01:29,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:01:29,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:01:29" (1/3) ... [2022-04-08 10:01:29,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e59329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:01:29, skipping insertion in model container [2022-04-08 10:01:29,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:01:29" (2/3) ... [2022-04-08 10:01:29,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e59329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:01:29, skipping insertion in model container [2022-04-08 10:01:29,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:01:29" (3/3) ... [2022-04-08 10:01:29,820 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-04-08 10:01:29,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:01:29,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:01:29,852 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:01:29,856 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:01:29,857 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:01:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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:01:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 10:01:29,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:29,874 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:29,874 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:29,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-04-08 10:01:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:29,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2070947987] [2022-04-08 10:01:29,892 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:01:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 2 times [2022-04-08 10:01:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:29,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274639268] [2022-04-08 10:01:29,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:30,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {24#true} is VALID [2022-04-08 10:01:30,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 10:01:30,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-08 10:01:30,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:30,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {24#true} is VALID [2022-04-08 10:01:30,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 10:01:30,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-08 10:01:30,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-08 10:01:30,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:30,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:30,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:30,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:30,194 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:01:30,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:01:30,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-08 10:01:30,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 10:01:30,196 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:01:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:30,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274639268] [2022-04-08 10:01:30,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274639268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:30,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:30,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:01:30,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:30,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2070947987] [2022-04-08 10:01:30,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2070947987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:30,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:30,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:01:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758932763] [2022-04-08 10:01:30,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 10:01:30,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:30,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:30,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:01:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:30,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:01:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:01:30,259 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:30,533 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-08 10:01:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:01:30,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 10:01:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 10:01:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-08 10:01:30,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-08 10:01:30,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:30,604 INFO L225 Difference]: With dead ends: 46 [2022-04-08 10:01:30,604 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 10:01:30,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:01:30,613 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:30,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 10:01:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 10:01:30,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:30,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,642 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,643 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:30,651 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 10:01:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:01:30,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:30,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:30,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:01:30,655 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 10:01:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:30,660 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 10:01:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:01:30,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:30,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:30,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:30,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 10:01:30,665 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-08 10:01:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:30,665 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 10:01:30,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 10:01:30,688 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:01:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:01:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:01:30,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:30,689 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:30,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:01:30,689 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-04-08 10:01:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:30,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945230278] [2022-04-08 10:01:30,703 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:30,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 2 times [2022-04-08 10:01:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:30,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275849126] [2022-04-08 10:01:30,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:30,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {203#true} is VALID [2022-04-08 10:01:30,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-08 10:01:30,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-08 10:01:30,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:30,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {203#true} is VALID [2022-04-08 10:01:30,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-08 10:01:30,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-08 10:01:30,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret9 := main(); {203#true} is VALID [2022-04-08 10:01:30,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {208#(= main_~y~0 0)} is VALID [2022-04-08 10:01:30,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {208#(= main_~y~0 0)} is VALID [2022-04-08 10:01:30,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(= main_~y~0 0)} ~z~0 := ~y~0; {209#(= main_~z~0 0)} is VALID [2022-04-08 10:01:30,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(= main_~z~0 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; {204#false} is VALID [2022-04-08 10:01:30,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} assume !(~z~0 % 4294967296 > 0); {204#false} is VALID [2022-04-08 10:01:30,745 INFO L272 TraceCheckUtils]: 10: Hoare triple {204#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {204#false} is VALID [2022-04-08 10:01:30,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} ~cond := #in~cond; {204#false} is VALID [2022-04-08 10:01:30,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {204#false} assume 0 == ~cond; {204#false} is VALID [2022-04-08 10:01:30,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-08 10:01:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275849126] [2022-04-08 10:01:30,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275849126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:30,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:30,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:01:30,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:30,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945230278] [2022-04-08 10:01:30,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945230278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:30,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:30,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:01:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990097308] [2022-04-08 10:01:30,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:30,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 10:01:30,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:30,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:30,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:01:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:01:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:01:30,757 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:30,816 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-08 10:01:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:01:30,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 10:01:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-08 10:01:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-08 10:01:30,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-08 10:01:30,842 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:01:30,842 INFO L225 Difference]: With dead ends: 23 [2022-04-08 10:01:30,843 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 10:01:30,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:01:30,844 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:30,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:01:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 10:01:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 10:01:30,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:30,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,847 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,848 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:30,848 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 10:01:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 10:01:30,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:30,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:30,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 10:01:30,850 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-08 10:01:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:30,852 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-08 10:01:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 10:01:30,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:30,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:30,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:30,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-08 10:01:30,854 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-08 10:01:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:30,854 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-08 10:01:30,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:30,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-08 10:01:30,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 10:01:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:01:30,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:30,869 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:30,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:01:30,869 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-04-08 10:01:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:30,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176315317] [2022-04-08 10:01:30,884 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:30,884 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 2 times [2022-04-08 10:01:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:30,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367603685] [2022-04-08 10:01:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:31,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {323#true} is VALID [2022-04-08 10:01:31,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-08 10:01:31,018 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-08 10:01:31,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:31,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {323#true} is VALID [2022-04-08 10:01:31,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-08 10:01:31,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-08 10:01:31,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret9 := main(); {323#true} is VALID [2022-04-08 10:01:31,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {328#(= main_~y~0 0)} is VALID [2022-04-08 10:01:31,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {328#(= 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; {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:31,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:31,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {330#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:31,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {330#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {324#false} is VALID [2022-04-08 10:01:31,027 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {324#false} is VALID [2022-04-08 10:01:31,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 10:01:31,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 10:01:31,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 10:01:31,027 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:01:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367603685] [2022-04-08 10:01:31,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367603685] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:31,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306821898] [2022-04-08 10:01:31,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:31,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:31,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:31,047 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:01:31,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:01:31,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:31,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:31,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:01:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:31,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:31,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-08 10:01:31,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#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); {323#true} is VALID [2022-04-08 10:01:31,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-08 10:01:31,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-08 10:01:31,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret9 := main(); {323#true} is VALID [2022-04-08 10:01:31,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {328#(= main_~y~0 0)} is VALID [2022-04-08 10:01:31,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {328#(= 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; {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:31,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:31,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {359#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:31,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {324#false} is VALID [2022-04-08 10:01:31,322 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {324#false} is VALID [2022-04-08 10:01:31,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 10:01:31,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 10:01:31,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 10:01:31,323 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:01:31,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:31,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-08 10:01:31,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-08 10:01:31,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-08 10:01:31,411 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {324#false} is VALID [2022-04-08 10:01:31,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {324#false} is VALID [2022-04-08 10:01:31,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {387#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:31,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:31,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(< 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; {391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:31,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {398#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:31,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {323#true} call #t~ret9 := main(); {323#true} is VALID [2022-04-08 10:01:31,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {323#true} {323#true} #50#return; {323#true} is VALID [2022-04-08 10:01:31,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#true} assume true; {323#true} is VALID [2022-04-08 10:01:31,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#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); {323#true} is VALID [2022-04-08 10:01:31,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-08 10:01:31,414 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:01:31,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306821898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:31,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:31,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 10:01:31,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:31,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176315317] [2022-04-08 10:01:31,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176315317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:31,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:31,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:01:31,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098925804] [2022-04-08 10:01:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 10:01:31,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:31,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:31,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:01:31,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:01:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:01:31,428 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:31,557 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 10:01:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:01:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 10:01:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 10:01:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 10:01:31,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-08 10:01:31,582 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:01:31,583 INFO L225 Difference]: With dead ends: 25 [2022-04-08 10:01:31,583 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 10:01:31,583 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 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:01:31,584 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:31,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:01:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 10:01:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-08 10:01:31,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:31,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,594 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,594 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:31,595 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 10:01:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 10:01:31,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:31,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:31,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 10:01:31,596 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 10:01:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:31,597 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 10:01:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 10:01:31,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:31,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:31,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:31,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 10:01:31,598 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-04-08 10:01:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:31,598 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 10:01:31,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:31,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 10:01:31,615 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:01:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 10:01:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:01:31,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:31,615 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:31,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:01:31,828 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:01:31,828 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-04-08 10:01:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:31,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872561371] [2022-04-08 10:01:31,835 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:31,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 2 times [2022-04-08 10:01:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:31,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407975383] [2022-04-08 10:01:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:31,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {551#true} is VALID [2022-04-08 10:01:31,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 10:01:31,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-08 10:01:31,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:31,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {551#true} is VALID [2022-04-08 10:01:31,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 10:01:31,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-08 10:01:32,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2022-04-08 10:01:32,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:32,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:32,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:32,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:32,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {558#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:32,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {558#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:32,004 INFO L272 TraceCheckUtils]: 11: Hoare triple {558#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {559#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:01:32,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {559#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {560#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:01:32,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {560#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {552#false} is VALID [2022-04-08 10:01:32,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-08 10:01:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:32,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407975383] [2022-04-08 10:01:32,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407975383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:32,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756017881] [2022-04-08 10:01:32,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:32,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:32,024 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:01:32,071 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:01:32,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:32,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:32,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:01:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:32,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:32,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2022-04-08 10:01:32,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#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); {551#true} is VALID [2022-04-08 10:01:32,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 10:01:32,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-08 10:01:32,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2022-04-08 10:01:32,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:32,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:32,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:32,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} ~z~0 := ~y~0; {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:32,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {557#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:32,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:32,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {556#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:32,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:32,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {552#false} is VALID [2022-04-08 10:01:32,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-08 10:01:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:32,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:32,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-08 10:01:32,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {552#false} is VALID [2022-04-08 10:01:32,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:32,344 INFO L272 TraceCheckUtils]: 11: Hoare triple {618#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:32,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {618#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {618#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:32,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {625#(= (mod main_~n~0 4294967296) (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; {618#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:32,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} ~z~0 := ~y~0; {625#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:32,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} assume !(~x~0 % 4294967296 > 0); {625#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:32,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(= (mod main_~n~0 4294967296) (mod 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; {625#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:32,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {618#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:32,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret9 := main(); {551#true} is VALID [2022-04-08 10:01:32,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #50#return; {551#true} is VALID [2022-04-08 10:01:32,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-08 10:01:32,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#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); {551#true} is VALID [2022-04-08 10:01:32,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2022-04-08 10:01:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756017881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:32,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:32,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-08 10:01:32,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:32,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872561371] [2022-04-08 10:01:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872561371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:32,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:32,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:01:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109726632] [2022-04-08 10:01:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:32,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:01:32,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:32,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:32,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:01:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:32,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:01:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:01:32,373 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:32,560 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-08 10:01:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:01:32,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:01:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-08 10:01:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-08 10:01:32,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-08 10:01:32,583 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:01:32,584 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:01:32,584 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:01:32,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:01:32,585 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:32,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:01:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 10:01:32,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:32,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,598 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,598 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:32,599 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 10:01:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:01:32,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:32,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:32,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 10:01:32,600 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 10:01:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:32,601 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 10:01:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:01:32,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:32,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:32,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:32,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-08 10:01:32,602 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-08 10:01:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:32,602 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-08 10:01:32,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:32,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-08 10:01:32,620 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:01:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:01:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:01:32,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:32,621 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:32,654 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:01:32,833 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:01:32,833 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash 507290039, now seen corresponding path program 3 times [2022-04-08 10:01:32,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:32,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091344145] [2022-04-08 10:01:32,837 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:32,837 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash 507290039, now seen corresponding path program 4 times [2022-04-08 10:01:32,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:32,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614040187] [2022-04-08 10:01:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:32,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:32,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:32,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {787#true} is VALID [2022-04-08 10:01:32,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-08 10:01:32,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-08 10:01:32,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:32,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {787#true} is VALID [2022-04-08 10:01:32,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-08 10:01:32,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-08 10:01:32,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret9 := main(); {787#true} is VALID [2022-04-08 10:01:32,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {792#(= main_~y~0 0)} is VALID [2022-04-08 10:01:32,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {792#(= 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; {793#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:32,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(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; {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:32,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:32,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {795#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:32,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {795#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {788#false} is VALID [2022-04-08 10:01:32,972 INFO L272 TraceCheckUtils]: 11: Hoare triple {788#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {788#false} is VALID [2022-04-08 10:01:32,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#false} ~cond := #in~cond; {788#false} is VALID [2022-04-08 10:01:32,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} assume 0 == ~cond; {788#false} is VALID [2022-04-08 10:01:32,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} assume !false; {788#false} is VALID [2022-04-08 10:01:32,972 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:01:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:32,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614040187] [2022-04-08 10:01:32,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614040187] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:32,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910177368] [2022-04-08 10:01:32,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:32,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:32,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:32,973 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:01:32,974 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:01:32,999 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:32,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:32,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:01:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:33,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:33,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {787#true} is VALID [2022-04-08 10:01:33,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#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); {787#true} is VALID [2022-04-08 10:01:33,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-08 10:01:33,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-08 10:01:33,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret9 := main(); {787#true} is VALID [2022-04-08 10:01:33,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {792#(= main_~y~0 0)} is VALID [2022-04-08 10:01:33,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {792#(= 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; {793#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:33,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(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; {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:33,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:33,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {827#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:33,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {788#false} is VALID [2022-04-08 10:01:33,188 INFO L272 TraceCheckUtils]: 11: Hoare triple {788#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {788#false} is VALID [2022-04-08 10:01:33,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#false} ~cond := #in~cond; {788#false} is VALID [2022-04-08 10:01:33,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} assume 0 == ~cond; {788#false} is VALID [2022-04-08 10:01:33,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} assume !false; {788#false} is VALID [2022-04-08 10:01:33,188 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:01:33,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:33,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#false} assume !false; {788#false} is VALID [2022-04-08 10:01:33,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#false} assume 0 == ~cond; {788#false} is VALID [2022-04-08 10:01:33,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#false} ~cond := #in~cond; {788#false} is VALID [2022-04-08 10:01:33,271 INFO L272 TraceCheckUtils]: 11: Hoare triple {788#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {788#false} is VALID [2022-04-08 10:01:33,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {855#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {788#false} is VALID [2022-04-08 10:01:33,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {859#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {855#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:33,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {859#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {859#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:33,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(< 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; {859#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:33,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {870#(< 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; {866#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:33,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {787#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {870#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:33,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {787#true} call #t~ret9 := main(); {787#true} is VALID [2022-04-08 10:01:33,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {787#true} {787#true} #50#return; {787#true} is VALID [2022-04-08 10:01:33,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {787#true} assume true; {787#true} is VALID [2022-04-08 10:01:33,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {787#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); {787#true} is VALID [2022-04-08 10:01:33,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {787#true} call ULTIMATE.init(); {787#true} is VALID [2022-04-08 10:01:33,274 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:01:33,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910177368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:33,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:33,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 10:01:33,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:33,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091344145] [2022-04-08 10:01:33,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091344145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:33,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:33,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:01:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133794654] [2022-04-08 10:01:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:01:33,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:33,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:33,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:01:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:01:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:01:33,287 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:33,475 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-08 10:01:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:01:33,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:01:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 10:01:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-08 10:01:33,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-08 10:01:33,504 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:01:33,504 INFO L225 Difference]: With dead ends: 31 [2022-04-08 10:01:33,504 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 10:01:33,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 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:01:33,505 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:33,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 10:01:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-08 10:01:33,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:33,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,526 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,526 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:33,527 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 10:01:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 10:01:33,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:33,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:33,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 10:01:33,527 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-08 10:01:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:33,528 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 10:01:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 10:01:33,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:33,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:33,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:33,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-08 10:01:33,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-08 10:01:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:33,530 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-08 10:01:33,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:33,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-08 10:01:33,550 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:01:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 10:01:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:01:33,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:33,550 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:33,568 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:01:33,750 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:01:33,751 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 3 times [2022-04-08 10:01:33,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:33,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100209565] [2022-04-08 10:01:33,756 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:33,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 4 times [2022-04-08 10:01:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:33,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633391320] [2022-04-08 10:01:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:33,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1055#true} is VALID [2022-04-08 10:01:33,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-08 10:01:33,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-08 10:01:33,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:33,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1055#true} is VALID [2022-04-08 10:01:33,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-08 10:01:33,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-08 10:01:33,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret9 := main(); {1055#true} is VALID [2022-04-08 10:01:33,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {1055#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1060#(= main_~y~0 0)} is VALID [2022-04-08 10:01:33,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {1060#(= 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; {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:33,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:33,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1062#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:33,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(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; {1063#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:01:33,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {1063#(and (<= main_~z~0 0) (<= 0 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; {1056#false} is VALID [2022-04-08 10:01:33,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {1056#false} assume !(~z~0 % 4294967296 > 0); {1056#false} is VALID [2022-04-08 10:01:33,825 INFO L272 TraceCheckUtils]: 12: Hoare triple {1056#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1056#false} is VALID [2022-04-08 10:01:33,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#false} ~cond := #in~cond; {1056#false} is VALID [2022-04-08 10:01:33,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {1056#false} assume 0 == ~cond; {1056#false} is VALID [2022-04-08 10:01:33,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-08 10:01:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:33,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:33,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633391320] [2022-04-08 10:01:33,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633391320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:33,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653055279] [2022-04-08 10:01:33,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:33,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:33,827 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:01:33,828 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:01:33,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:33,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:33,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:01:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:33,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:34,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1055#true} is VALID [2022-04-08 10:01:34,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#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); {1055#true} is VALID [2022-04-08 10:01:34,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-08 10:01:34,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-08 10:01:34,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret9 := main(); {1055#true} is VALID [2022-04-08 10:01:34,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {1055#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1060#(= main_~y~0 0)} is VALID [2022-04-08 10:01:34,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {1060#(= 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; {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:34,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:34,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1062#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:34,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(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; {1063#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:01:34,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {1063#(and (<= main_~z~0 0) (<= 0 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; {1098#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:01:34,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1056#false} is VALID [2022-04-08 10:01:34,043 INFO L272 TraceCheckUtils]: 12: Hoare triple {1056#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1056#false} is VALID [2022-04-08 10:01:34,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#false} ~cond := #in~cond; {1056#false} is VALID [2022-04-08 10:01:34,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1056#false} assume 0 == ~cond; {1056#false} is VALID [2022-04-08 10:01:34,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-08 10:01:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:34,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:34,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-08 10:01:34,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {1056#false} assume 0 == ~cond; {1056#false} is VALID [2022-04-08 10:01:34,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#false} ~cond := #in~cond; {1056#false} is VALID [2022-04-08 10:01:34,176 INFO L272 TraceCheckUtils]: 12: Hoare triple {1056#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1056#false} is VALID [2022-04-08 10:01:34,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1056#false} is VALID [2022-04-08 10:01:34,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#(< 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; {1126#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:34,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {1134#(< 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; {1130#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:34,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {1134#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:34,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1138#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:34,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {1145#(< 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; {1138#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:34,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {1055#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1145#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:34,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret9 := main(); {1055#true} is VALID [2022-04-08 10:01:34,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #50#return; {1055#true} is VALID [2022-04-08 10:01:34,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-08 10:01:34,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#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); {1055#true} is VALID [2022-04-08 10:01:34,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1055#true} is VALID [2022-04-08 10:01:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:34,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653055279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:34,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:34,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-08 10:01:34,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:34,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100209565] [2022-04-08 10:01:34,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100209565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:34,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:34,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:01:34,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618193612] [2022-04-08 10:01:34,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:34,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:01:34,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:34,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:34,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:01:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:34,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:01:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:01:34,192 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:34,334 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 10:01:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:01:34,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:01:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-08 10:01:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-08 10:01:34,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-08 10:01:34,356 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:01:34,359 INFO L225 Difference]: With dead ends: 28 [2022-04-08 10:01:34,359 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 10:01:34,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:01:34,362 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:34,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:01:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 10:01:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 10:01:34,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:34,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,375 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,376 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:34,378 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 10:01:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:01:34,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:34,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:34,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 10:01:34,379 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-08 10:01:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:34,379 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 10:01:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:01:34,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:34,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:34,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:34,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-08 10:01:34,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-04-08 10:01:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:34,382 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-08 10:01:34,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:34,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-08 10:01:34,396 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:01:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 10:01:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:01:34,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:34,396 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:34,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 10:01:34,612 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:01:34,612 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1419382901, now seen corresponding path program 5 times [2022-04-08 10:01:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:34,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046481805] [2022-04-08 10:01:34,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:34,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1419382901, now seen corresponding path program 6 times [2022-04-08 10:01:34,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:34,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480720818] [2022-04-08 10:01:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:34,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {1316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1306#true} is VALID [2022-04-08 10:01:34,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 10:01:34,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-08 10:01:34,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:34,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1306#true} is VALID [2022-04-08 10:01:34,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 10:01:34,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-08 10:01:34,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret9 := main(); {1306#true} is VALID [2022-04-08 10:01:34,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1311#(= main_~y~0 0)} is VALID [2022-04-08 10:01:34,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {1311#(= 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; {1312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:34,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {1312#(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; {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:34,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:34,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1314#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:34,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {1314#(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; {1315#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:34,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {1315#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1307#false} is VALID [2022-04-08 10:01:34,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {1307#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1307#false} is VALID [2022-04-08 10:01:34,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-08 10:01:34,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 10:01:34,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 10:01:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:34,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480720818] [2022-04-08 10:01:34,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480720818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:34,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255762816] [2022-04-08 10:01:34,691 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:01:34,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:34,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:34,692 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:01:34,693 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:01:34,722 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-08 10:01:34,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:34,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:01:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:34,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:34,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-08 10:01:34,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#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); {1306#true} is VALID [2022-04-08 10:01:34,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 10:01:34,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-08 10:01:34,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret9 := main(); {1306#true} is VALID [2022-04-08 10:01:34,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1311#(= main_~y~0 0)} is VALID [2022-04-08 10:01:34,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {1311#(= 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; {1312#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:34,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {1312#(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; {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:34,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:34,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {1313#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {1314#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:34,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {1314#(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; {1350#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:34,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1350#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1307#false} is VALID [2022-04-08 10:01:34,897 INFO L272 TraceCheckUtils]: 12: Hoare triple {1307#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1307#false} is VALID [2022-04-08 10:01:34,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-08 10:01:34,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 10:01:34,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 10:01:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:34,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:35,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-08 10:01:35,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-08 10:01:35,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-08 10:01:35,008 INFO L272 TraceCheckUtils]: 12: Hoare triple {1307#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1307#false} is VALID [2022-04-08 10:01:35,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {1378#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1307#false} is VALID [2022-04-08 10:01:35,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {1382#(< 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; {1378#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:35,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {1386#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {1382#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:35,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {1386#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1386#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:35,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(< 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; {1386#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:35,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {1397#(< 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; {1393#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:35,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1397#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:35,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret9 := main(); {1306#true} is VALID [2022-04-08 10:01:35,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #50#return; {1306#true} is VALID [2022-04-08 10:01:35,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-08 10:01:35,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#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); {1306#true} is VALID [2022-04-08 10:01:35,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-08 10:01:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:35,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255762816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:35,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:35,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 10:01:35,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:35,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046481805] [2022-04-08 10:01:35,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046481805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:35,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:35,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:01:35,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830796009] [2022-04-08 10:01:35,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:01:35,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:35,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:35,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:01:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:35,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:01:35,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:01:35,029 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:35,228 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 10:01:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:01:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:01:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-08 10:01:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-08 10:01:35,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-08 10:01:35,252 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:01:35,253 INFO L225 Difference]: With dead ends: 27 [2022-04-08 10:01:35,253 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 10:01:35,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:01:35,253 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:35,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 10:01:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-04-08 10:01:35,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:35,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,276 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,276 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:35,277 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 10:01:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 10:01:35,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:35,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:35,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 10:01:35,277 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 10:01:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:35,278 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 10:01:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 10:01:35,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:35,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:35,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:35,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-08 10:01:35,279 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-04-08 10:01:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:35,279 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-08 10:01:35,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-08 10:01:35,299 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:01:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-08 10:01:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:01:35,301 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:35,301 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:35,320 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:01:35,516 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:01:35,516 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:35,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash 778520620, now seen corresponding path program 5 times [2022-04-08 10:01:35,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:35,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1518099494] [2022-04-08 10:01:35,520 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:35,520 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash 778520620, now seen corresponding path program 6 times [2022-04-08 10:01:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:35,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611167600] [2022-04-08 10:01:35,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:35,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1566#true} is VALID [2022-04-08 10:01:35,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 10:01:35,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-08 10:01:35,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:35,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1566#true} is VALID [2022-04-08 10:01:35,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 10:01:35,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-08 10:01:35,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret9 := main(); {1566#true} is VALID [2022-04-08 10:01:35,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1571#(= main_~y~0 0)} is VALID [2022-04-08 10:01:35,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1571#(= 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; {1572#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:35,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(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; {1573#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:35,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(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; {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:35,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:35,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1575#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:35,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {1575#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1567#false} is VALID [2022-04-08 10:01:35,604 INFO L272 TraceCheckUtils]: 12: Hoare triple {1567#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1567#false} is VALID [2022-04-08 10:01:35,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-08 10:01:35,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-08 10:01:35,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-08 10:01:35,605 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:01:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611167600] [2022-04-08 10:01:35,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611167600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229562771] [2022-04-08 10:01:35,606 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:01:35,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:35,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:35,620 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:01:35,620 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:01:35,646 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:01:35,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:35,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:01:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:35,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:35,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-08 10:01:35,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-08 10:01:35,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 10:01:35,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-08 10:01:35,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret9 := main(); {1566#true} is VALID [2022-04-08 10:01:35,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1571#(= main_~y~0 0)} is VALID [2022-04-08 10:01:35,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {1571#(= 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; {1572#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:35,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(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; {1573#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:35,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(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; {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:35,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:35,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {1574#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1610#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:35,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1610#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1567#false} is VALID [2022-04-08 10:01:35,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {1567#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1567#false} is VALID [2022-04-08 10:01:35,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-08 10:01:35,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-08 10:01:35,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-08 10:01:35,841 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:01:35,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:35,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-08 10:01:35,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-08 10:01:35,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-08 10:01:35,940 INFO L272 TraceCheckUtils]: 12: Hoare triple {1567#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1567#false} is VALID [2022-04-08 10:01:35,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {1638#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1567#false} is VALID [2022-04-08 10:01:35,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {1642#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1638#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:35,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {1642#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1642#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:35,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {1649#(< 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; {1642#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:35,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {1653#(< 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; {1649#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:35,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {1657#(< 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; {1653#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:35,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {1566#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1657#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:35,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret9 := main(); {1566#true} is VALID [2022-04-08 10:01:35,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #50#return; {1566#true} is VALID [2022-04-08 10:01:35,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-08 10:01:35,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1566#true} is VALID [2022-04-08 10:01:35,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-08 10:01:35,944 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:01:35,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229562771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:35,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:35,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 10:01:35,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:35,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1518099494] [2022-04-08 10:01:35,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1518099494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:35,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:35,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:01:35,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104796253] [2022-04-08 10:01:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:35,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:01:35,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:35,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:35,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:35,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:01:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:35,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:01:35,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:01:35,957 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:36,202 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 10:01:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:01:36,202 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:01:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 10:01:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 10:01:36,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-08 10:01:36,230 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:01:36,231 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:01:36,231 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 10:01:36,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 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:01:36,232 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:36,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 10:01:36,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-04-08 10:01:36,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:36,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,252 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,253 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:36,254 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-08 10:01:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-08 10:01:36,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:36,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:36,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:01:36,254 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:01:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:36,255 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-08 10:01:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-08 10:01:36,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:36,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:36,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:36,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-08 10:01:36,256 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2022-04-08 10:01:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:36,256 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-08 10:01:36,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:36,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-08 10:01:36,278 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:01:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 10:01:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:01:36,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:36,278 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:36,296 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:01:36,487 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:01:36,487 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1016701897, now seen corresponding path program 7 times [2022-04-08 10:01:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:36,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [185357373] [2022-04-08 10:01:36,491 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:36,491 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1016701897, now seen corresponding path program 8 times [2022-04-08 10:01:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:36,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564567134] [2022-04-08 10:01:36,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:36,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:36,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {1861#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1850#true} is VALID [2022-04-08 10:01:36,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-08 10:01:36,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-08 10:01:36,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1861#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:36,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1861#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {1850#true} is VALID [2022-04-08 10:01:36,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-08 10:01:36,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-08 10:01:36,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1850#true} call #t~ret9 := main(); {1850#true} is VALID [2022-04-08 10:01:36,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:36,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:36,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:36,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:36,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:36,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:36,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {1858#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:36,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {1858#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {1858#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:36,633 INFO L272 TraceCheckUtils]: 13: Hoare triple {1858#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:01:36,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {1859#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1860#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:01:36,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {1860#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1851#false} is VALID [2022-04-08 10:01:36,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-04-08 10:01:36,634 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:01:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564567134] [2022-04-08 10:01:36,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564567134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:36,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277678906] [2022-04-08 10:01:36,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:36,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:36,635 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:01:36,636 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:01:36,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:36,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:36,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:01:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:36,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:36,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1850#true} is VALID [2022-04-08 10:01:36,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#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); {1850#true} is VALID [2022-04-08 10:01:36,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-08 10:01:36,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-08 10:01:36,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {1850#true} call #t~ret9 := main(); {1850#true} is VALID [2022-04-08 10:01:36,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {1850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:36,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:36,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:36,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} assume !(~x~0 % 4294967296 > 0); {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:36,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} ~z~0 := ~y~0; {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:36,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {1857#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:36,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {1856#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:36,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:36,783 INFO L272 TraceCheckUtils]: 13: Hoare triple {1855#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:36,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:36,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1851#false} is VALID [2022-04-08 10:01:36,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-04-08 10:01:36,784 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:01:36,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:36,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-04-08 10:01:36,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1851#false} is VALID [2022-04-08 10:01:36,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:36,902 INFO L272 TraceCheckUtils]: 13: Hoare triple {1924#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:36,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1924#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:36,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {1931#(= (mod main_~n~0 4294967296) (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; {1924#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:36,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {1935#(= (mod main_~n~0 4294967296) (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; {1931#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:36,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1935#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} ~z~0 := ~y~0; {1935#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:01:36,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1935#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1935#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:01:36,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1931#(= (mod main_~n~0 4294967296) (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; {1935#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:01:36,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {1924#(= (mod main_~n~0 4294967296) (mod 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; {1931#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:36,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {1850#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1924#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:36,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {1850#true} call #t~ret9 := main(); {1850#true} is VALID [2022-04-08 10:01:36,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #50#return; {1850#true} is VALID [2022-04-08 10:01:36,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-04-08 10:01:36,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#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); {1850#true} is VALID [2022-04-08 10:01:36,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1850#true} is VALID [2022-04-08 10:01:36,911 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:01:36,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277678906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:36,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:36,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-04-08 10:01:36,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [185357373] [2022-04-08 10:01:36,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [185357373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:36,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:36,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:01:36,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778620721] [2022-04-08 10:01:36,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:36,912 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:01:36,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:36,913 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:01:36,948 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:01:36,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:01:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:01:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:01:36,949 INFO L87 Difference]: Start difference. First operand 22 states and 25 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:01:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:37,157 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 10:01:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:01:37,157 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:01:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:37,157 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:01:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-08 10:01:37,158 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:01:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-08 10:01:37,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2022-04-08 10:01:37,179 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:01:37,179 INFO L225 Difference]: With dead ends: 29 [2022-04-08 10:01:37,179 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:01:37,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:01:37,180 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:37,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:01:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-08 10:01:37,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:37,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:37,210 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:37,210 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:37,211 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:01:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:01:37,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:37,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:37,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 10:01:37,211 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 10:01:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:37,212 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:01:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:01:37,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:37,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:37,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:37,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-08 10:01:37,212 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2022-04-08 10:01:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:37,213 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-08 10:01:37,213 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:01:37,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-08 10:01:37,246 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:01:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 10:01:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:01:37,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:37,246 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:37,264 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:01:37,462 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:01:37,462 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1601169482, now seen corresponding path program 9 times [2022-04-08 10:01:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:37,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [572963314] [2022-04-08 10:01:37,465 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:37,466 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1601169482, now seen corresponding path program 10 times [2022-04-08 10:01:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:37,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259308433] [2022-04-08 10:01:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:37,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:37,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {2141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2130#true} is VALID [2022-04-08 10:01:37,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:01:37,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-08 10:01:37,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:37,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {2141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2130#true} is VALID [2022-04-08 10:01:37,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:01:37,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-08 10:01:37,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret9 := main(); {2130#true} is VALID [2022-04-08 10:01:37,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2135#(= main_~y~0 0)} is VALID [2022-04-08 10:01:37,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {2135#(= 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; {2136#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:37,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {2136#(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; {2137#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:37,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {2137#(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; {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:37,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:37,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2139#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:37,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {2139#(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; {2140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:37,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {2140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2131#false} is VALID [2022-04-08 10:01:37,551 INFO L272 TraceCheckUtils]: 13: Hoare triple {2131#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2131#false} is VALID [2022-04-08 10:01:37,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#false} ~cond := #in~cond; {2131#false} is VALID [2022-04-08 10:01:37,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {2131#false} assume 0 == ~cond; {2131#false} is VALID [2022-04-08 10:01:37,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-08 10:01:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:37,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:37,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259308433] [2022-04-08 10:01:37,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259308433] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:37,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10293140] [2022-04-08 10:01:37,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:37,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:37,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:37,579 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:01:37,592 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:01:37,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:37,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:37,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:01:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:37,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:37,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-08 10:01:37,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#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); {2130#true} is VALID [2022-04-08 10:01:37,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:01:37,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-08 10:01:37,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret9 := main(); {2130#true} is VALID [2022-04-08 10:01:37,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2135#(= main_~y~0 0)} is VALID [2022-04-08 10:01:37,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {2135#(= 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; {2136#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:37,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {2136#(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; {2137#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:37,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {2137#(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; {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:37,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:37,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {2138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {2139#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:37,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {2139#(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; {2178#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:37,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {2178#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2131#false} is VALID [2022-04-08 10:01:37,810 INFO L272 TraceCheckUtils]: 13: Hoare triple {2131#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2131#false} is VALID [2022-04-08 10:01:37,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#false} ~cond := #in~cond; {2131#false} is VALID [2022-04-08 10:01:37,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {2131#false} assume 0 == ~cond; {2131#false} is VALID [2022-04-08 10:01:37,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-08 10:01:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:37,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:37,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2022-04-08 10:01:37,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {2131#false} assume 0 == ~cond; {2131#false} is VALID [2022-04-08 10:01:37,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {2131#false} ~cond := #in~cond; {2131#false} is VALID [2022-04-08 10:01:37,935 INFO L272 TraceCheckUtils]: 13: Hoare triple {2131#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2131#false} is VALID [2022-04-08 10:01:37,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {2206#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2131#false} is VALID [2022-04-08 10:01:37,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {2210#(< 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; {2206#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:37,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {2214#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {2210#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:37,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {2214#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:37,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#(< 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; {2214#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:37,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {2225#(< 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; {2221#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:37,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {2229#(< 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; {2225#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:37,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {2130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2229#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:37,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {2130#true} call #t~ret9 := main(); {2130#true} is VALID [2022-04-08 10:01:37,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2130#true} {2130#true} #50#return; {2130#true} is VALID [2022-04-08 10:01:37,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {2130#true} assume true; {2130#true} is VALID [2022-04-08 10:01:37,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#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); {2130#true} is VALID [2022-04-08 10:01:37,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2022-04-08 10:01:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:37,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10293140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:37,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:37,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 10:01:37,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:37,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [572963314] [2022-04-08 10:01:37,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [572963314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:37,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:37,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:01:37,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912148707] [2022-04-08 10:01:37,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:37,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:37,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:37,944 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), 8 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:01:37,956 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:01:37,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:01:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:37,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:01:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:01:37,956 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:38,301 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 10:01:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:01:38,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-08 10:01:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-08 10:01:38,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-08 10:01:38,331 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:01:38,332 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:01:38,332 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 10:01:38,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:01:38,333 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:38,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 49 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 10:01:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2022-04-08 10:01:38,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:38,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:38,363 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:38,364 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:38,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:38,364 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-08 10:01:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-08 10:01:38,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:38,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:38,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 10:01:38,365 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 10:01:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:38,365 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-08 10:01:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-08 10:01:38,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:38,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:38,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:38,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-08 10:01:38,366 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2022-04-08 10:01:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:38,366 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-08 10:01:38,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:38,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-08 10:01:38,395 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:01:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 10:01:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:01:38,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:38,395 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:38,413 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:01:38,611 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:01:38,612 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash 596734039, now seen corresponding path program 7 times [2022-04-08 10:01:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:38,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954282349] [2022-04-08 10:01:38,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:38,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 596734039, now seen corresponding path program 8 times [2022-04-08 10:01:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:38,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539294947] [2022-04-08 10:01:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:38,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {2447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2436#true} is VALID [2022-04-08 10:01:38,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-08 10:01:38,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-08 10:01:38,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:38,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {2447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2436#true} is VALID [2022-04-08 10:01:38,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-08 10:01:38,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-08 10:01:38,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret9 := main(); {2436#true} is VALID [2022-04-08 10:01:38,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2441#(= main_~y~0 0)} is VALID [2022-04-08 10:01:38,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= 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; {2442#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:38,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(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; {2443#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:38,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(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; {2444#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:38,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(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; {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:38,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:38,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2446#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:38,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {2446#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2437#false} is VALID [2022-04-08 10:01:38,699 INFO L272 TraceCheckUtils]: 13: Hoare triple {2437#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2437#false} is VALID [2022-04-08 10:01:38,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-08 10:01:38,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-08 10:01:38,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-08 10:01:38,699 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:01:38,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:38,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539294947] [2022-04-08 10:01:38,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539294947] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:38,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483899038] [2022-04-08 10:01:38,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:38,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:38,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:38,716 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:01:38,718 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:01:38,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:38,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:38,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:01:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:38,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:38,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-08 10:01:38,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#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); {2436#true} is VALID [2022-04-08 10:01:38,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-08 10:01:38,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-08 10:01:38,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret9 := main(); {2436#true} is VALID [2022-04-08 10:01:38,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2441#(= main_~y~0 0)} is VALID [2022-04-08 10:01:38,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= 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; {2442#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:38,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(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; {2443#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:38,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(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; {2444#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:38,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(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; {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:38,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:38,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {2445#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2484#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:38,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {2484#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {2437#false} is VALID [2022-04-08 10:01:38,915 INFO L272 TraceCheckUtils]: 13: Hoare triple {2437#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2437#false} is VALID [2022-04-08 10:01:38,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-08 10:01:38,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-08 10:01:38,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-08 10:01:38,916 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:01:38,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:39,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-08 10:01:39,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-08 10:01:39,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-08 10:01:39,041 INFO L272 TraceCheckUtils]: 13: Hoare triple {2437#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2437#false} is VALID [2022-04-08 10:01:39,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {2512#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2437#false} is VALID [2022-04-08 10:01:39,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {2516#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {2512#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:39,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {2516#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2516#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:39,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2523#(< 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; {2516#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:39,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {2527#(< 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; {2523#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:39,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {2531#(< 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; {2527#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:39,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {2535#(< 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; {2531#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:39,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2535#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:01:39,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret9 := main(); {2436#true} is VALID [2022-04-08 10:01:39,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #50#return; {2436#true} is VALID [2022-04-08 10:01:39,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-08 10:01:39,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#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); {2436#true} is VALID [2022-04-08 10:01:39,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-08 10:01:39,047 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:01:39,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483899038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:39,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:39,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 10:01:39,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954282349] [2022-04-08 10:01:39,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954282349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:39,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:39,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:01:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932600634] [2022-04-08 10:01:39,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:39,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:39,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:39,049 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), 8 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:01:39,062 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:01:39,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:01:39,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:39,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:01:39,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:01:39,064 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:39,448 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 10:01:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:01:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:39,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 10:01:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 10:01:39,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-08 10:01:39,484 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:01:39,485 INFO L225 Difference]: With dead ends: 39 [2022-04-08 10:01:39,485 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:01:39,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:01:39,486 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:39,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 52 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:01:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-04-08 10:01:39,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:39,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:39,524 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:39,524 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:39,525 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 10:01:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 10:01:39,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:39,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:39,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-08 10:01:39,526 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-08 10:01:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:39,526 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 10:01:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-08 10:01:39,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:39,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:39,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:39,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-08 10:01:39,527 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2022-04-08 10:01:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:39,527 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-08 10:01:39,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 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:01:39,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-08 10:01:39,556 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:01:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-08 10:01:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:01:39,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:39,557 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:39,579 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:01:39,769 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:01:39,770 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1418492661, now seen corresponding path program 11 times [2022-04-08 10:01:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:39,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917993223] [2022-04-08 10:01:39,773 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:39,773 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1418492661, now seen corresponding path program 12 times [2022-04-08 10:01:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:39,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753898653] [2022-04-08 10:01:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:39,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2764#true} is VALID [2022-04-08 10:01:39,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-08 10:01:39,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-08 10:01:39,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {2764#true} call ULTIMATE.init(); {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:39,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {2764#true} is VALID [2022-04-08 10:01:39,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-08 10:01:39,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-08 10:01:39,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret9 := main(); {2764#true} is VALID [2022-04-08 10:01:39,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {2764#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2769#(= main_~y~0 0)} is VALID [2022-04-08 10:01:39,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {2769#(= 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; {2770#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:39,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {2770#(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; {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:39,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:39,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2772#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:39,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {2772#(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; {2773#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:39,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {2773#(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; {2774#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:01:39,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(and (<= main_~z~0 0) (<= 0 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; {2765#false} is VALID [2022-04-08 10:01:39,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {2765#false} assume !(~z~0 % 4294967296 > 0); {2765#false} is VALID [2022-04-08 10:01:39,851 INFO L272 TraceCheckUtils]: 14: Hoare triple {2765#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2765#false} is VALID [2022-04-08 10:01:39,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2022-04-08 10:01:39,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2022-04-08 10:01:39,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2022-04-08 10:01:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753898653] [2022-04-08 10:01:39,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753898653] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998443435] [2022-04-08 10:01:39,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:01:39,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:39,853 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:01:39,891 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:01:39,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:01:39,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:39,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:01:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:39,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:40,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2764#true} call ULTIMATE.init(); {2764#true} is VALID [2022-04-08 10:01:40,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2764#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); {2764#true} is VALID [2022-04-08 10:01:40,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-08 10:01:40,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-08 10:01:40,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret9 := main(); {2764#true} is VALID [2022-04-08 10:01:40,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {2764#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2769#(= main_~y~0 0)} is VALID [2022-04-08 10:01:40,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2769#(= 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; {2770#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:40,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {2770#(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; {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:40,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:40,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {2771#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2772#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:40,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {2772#(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; {2773#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:40,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {2773#(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; {2774#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:01:40,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(and (<= main_~z~0 0) (<= 0 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; {2815#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:01:40,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {2815#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2765#false} is VALID [2022-04-08 10:01:40,093 INFO L272 TraceCheckUtils]: 14: Hoare triple {2765#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2765#false} is VALID [2022-04-08 10:01:40,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2022-04-08 10:01:40,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2022-04-08 10:01:40,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2022-04-08 10:01:40,094 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:01:40,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:40,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2022-04-08 10:01:40,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2022-04-08 10:01:40,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2022-04-08 10:01:40,232 INFO L272 TraceCheckUtils]: 14: Hoare triple {2765#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2765#false} is VALID [2022-04-08 10:01:40,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {2843#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2765#false} is VALID [2022-04-08 10:01:40,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {2847#(< 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; {2843#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:40,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {2851#(< 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; {2847#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:40,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {2855#(< 0 (mod (+ main_~z~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; {2851#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:40,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {2859#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {2855#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:40,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {2859#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {2859#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:40,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {2866#(< 0 (mod (+ main_~y~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; {2859#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:40,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {2870#(< 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; {2866#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:40,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {2764#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2870#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:40,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret9 := main(); {2764#true} is VALID [2022-04-08 10:01:40,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #50#return; {2764#true} is VALID [2022-04-08 10:01:40,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2022-04-08 10:01:40,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2764#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); {2764#true} is VALID [2022-04-08 10:01:40,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {2764#true} call ULTIMATE.init(); {2764#true} is VALID [2022-04-08 10:01:40,238 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:01:40,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998443435] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:40,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:40,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-04-08 10:01:40,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:40,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917993223] [2022-04-08 10:01:40,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917993223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:40,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:40,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:01:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141093137] [2022-04-08 10:01:40,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:40,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:01:40,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:40,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:01:40,252 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:01:40,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:01:40,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:40,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:01:40,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:01:40,253 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:01:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:40,511 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-08 10:01:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:01:40,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:01:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:01:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-08 10:01:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:01:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-08 10:01:40,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 29 transitions. [2022-04-08 10:01:40,540 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:01:40,540 INFO L225 Difference]: With dead ends: 33 [2022-04-08 10:01:40,541 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:01:40,541 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:01:40,541 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:40,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:01:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 10:01:40,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:40,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:40,574 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:40,575 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:40,575 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 10:01:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 10:01:40,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:40,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:40,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 10:01:40,576 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 10:01:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:40,576 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 10:01:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 10:01:40,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:40,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:40,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:40,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-08 10:01:40,577 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-04-08 10:01:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:40,577 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-08 10:01:40,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:01:40,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-08 10:01:40,604 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:01:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-08 10:01:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:01:40,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:40,605 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:40,623 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:01:40,815 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:01:40,815 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1937848684, now seen corresponding path program 13 times [2022-04-08 10:01:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:40,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1350952432] [2022-04-08 10:01:40,820 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:40,820 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1937848684, now seen corresponding path program 14 times [2022-04-08 10:01:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:40,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981135202] [2022-04-08 10:01:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:40,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {3073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {3061#true} is VALID [2022-04-08 10:01:40,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-08 10:01:40,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-08 10:01:40,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {3061#true} call ULTIMATE.init(); {3073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:40,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {3073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {3061#true} is VALID [2022-04-08 10:01:40,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-08 10:01:40,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-08 10:01:40,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret9 := main(); {3061#true} is VALID [2022-04-08 10:01:40,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {3061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3066#(= main_~y~0 0)} is VALID [2022-04-08 10:01:40,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {3066#(= 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; {3067#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:40,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {3067#(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; {3068#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:40,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {3068#(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; {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:40,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:40,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3070#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:40,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {3070#(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; {3071#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:40,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {3071#(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; {3072#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:40,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {3072#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3062#false} is VALID [2022-04-08 10:01:40,921 INFO L272 TraceCheckUtils]: 14: Hoare triple {3062#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3062#false} is VALID [2022-04-08 10:01:40,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2022-04-08 10:01:40,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {3062#false} assume 0 == ~cond; {3062#false} is VALID [2022-04-08 10:01:40,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2022-04-08 10:01:40,921 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:01:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:40,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981135202] [2022-04-08 10:01:40,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981135202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:40,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340834172] [2022-04-08 10:01:40,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:40,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:40,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:40,923 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:01:40,924 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:01:40,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:40,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:40,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:01:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:40,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:41,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {3061#true} call ULTIMATE.init(); {3061#true} is VALID [2022-04-08 10:01:41,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {3061#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); {3061#true} is VALID [2022-04-08 10:01:41,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-08 10:01:41,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-08 10:01:41,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret9 := main(); {3061#true} is VALID [2022-04-08 10:01:41,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {3061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3066#(= main_~y~0 0)} is VALID [2022-04-08 10:01:41,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {3066#(= 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; {3067#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:41,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {3067#(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; {3068#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:41,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {3068#(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; {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:41,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:41,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {3069#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3070#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:41,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {3070#(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; {3071#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:41,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {3071#(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; {3113#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:41,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {3113#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3062#false} is VALID [2022-04-08 10:01:41,118 INFO L272 TraceCheckUtils]: 14: Hoare triple {3062#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3062#false} is VALID [2022-04-08 10:01:41,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2022-04-08 10:01:41,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {3062#false} assume 0 == ~cond; {3062#false} is VALID [2022-04-08 10:01:41,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2022-04-08 10:01:41,118 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:01:41,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:41,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {3062#false} assume !false; {3062#false} is VALID [2022-04-08 10:01:41,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {3062#false} assume 0 == ~cond; {3062#false} is VALID [2022-04-08 10:01:41,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {3062#false} ~cond := #in~cond; {3062#false} is VALID [2022-04-08 10:01:41,270 INFO L272 TraceCheckUtils]: 14: Hoare triple {3062#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3062#false} is VALID [2022-04-08 10:01:41,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {3141#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3062#false} is VALID [2022-04-08 10:01:41,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {3145#(< 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; {3141#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:41,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {3149#(< 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; {3145#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:41,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {3153#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {3149#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:41,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {3153#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3153#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:41,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {3160#(< 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; {3153#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:41,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {3164#(< 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; {3160#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:41,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {3168#(< 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; {3164#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:41,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {3061#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3168#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:41,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {3061#true} call #t~ret9 := main(); {3061#true} is VALID [2022-04-08 10:01:41,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3061#true} {3061#true} #50#return; {3061#true} is VALID [2022-04-08 10:01:41,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {3061#true} assume true; {3061#true} is VALID [2022-04-08 10:01:41,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {3061#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); {3061#true} is VALID [2022-04-08 10:01:41,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {3061#true} call ULTIMATE.init(); {3061#true} is VALID [2022-04-08 10:01:41,274 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:01:41,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340834172] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:41,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:41,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 10:01:41,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:41,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1350952432] [2022-04-08 10:01:41,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1350952432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:41,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:41,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:01:41,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67724138] [2022-04-08 10:01:41,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:41,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:41,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:41,287 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:01:41,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:01:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:01:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:01:41,288 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:41,488 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-08 10:01:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:01:41,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 10:01:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 10:01:41,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-08 10:01:41,506 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:01:41,507 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:01:41,507 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 10:01:41,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:01:41,507 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:41,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 46 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 10:01:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-08 10:01:41,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:41,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:41,529 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:41,529 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:41,530 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 10:01:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:41,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:41,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:41,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:01:41,530 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:01:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:41,531 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 10:01:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:41,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:41,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:41,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:41,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 10:01:41,532 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2022-04-08 10:01:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:41,532 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 10:01:41,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:41,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 10:01:41,553 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:01:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:01:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:01:41,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:41,554 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:41,570 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:01:41,754 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:01:41,754 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1353381099, now seen corresponding path program 15 times [2022-04-08 10:01:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:41,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951018319] [2022-04-08 10:01:41,758 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:41,758 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1353381099, now seen corresponding path program 16 times [2022-04-08 10:01:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:41,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332238519] [2022-04-08 10:01:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:41,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {3381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {3369#true} is VALID [2022-04-08 10:01:41,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-08 10:01:41,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-08 10:01:41,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {3369#true} call ULTIMATE.init(); {3381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:41,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3381#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {3369#true} is VALID [2022-04-08 10:01:41,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-08 10:01:41,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-08 10:01:41,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {3369#true} call #t~ret9 := main(); {3369#true} is VALID [2022-04-08 10:01:41,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {3369#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3374#(= main_~y~0 0)} is VALID [2022-04-08 10:01:41,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {3374#(= 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; {3375#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:41,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#(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; {3376#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:41,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {3376#(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; {3377#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:41,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(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; {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:41,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:41,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3379#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:41,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {3379#(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; {3380#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:41,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {3380#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3370#false} is VALID [2022-04-08 10:01:41,893 INFO L272 TraceCheckUtils]: 14: Hoare triple {3370#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3370#false} is VALID [2022-04-08 10:01:41,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#false} ~cond := #in~cond; {3370#false} is VALID [2022-04-08 10:01:41,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#false} assume 0 == ~cond; {3370#false} is VALID [2022-04-08 10:01:41,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {3370#false} assume !false; {3370#false} is VALID [2022-04-08 10:01:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:41,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332238519] [2022-04-08 10:01:41,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332238519] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:41,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450462040] [2022-04-08 10:01:41,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:41,895 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:01:41,895 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:01:41,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:41,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:41,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:01:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:41,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:42,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {3369#true} call ULTIMATE.init(); {3369#true} is VALID [2022-04-08 10:01:42,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {3369#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); {3369#true} is VALID [2022-04-08 10:01:42,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-08 10:01:42,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-08 10:01:42,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {3369#true} call #t~ret9 := main(); {3369#true} is VALID [2022-04-08 10:01:42,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {3369#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3374#(= main_~y~0 0)} is VALID [2022-04-08 10:01:42,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {3374#(= 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; {3375#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:42,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {3375#(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; {3376#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:42,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {3376#(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; {3377#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:42,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {3377#(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; {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:42,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:42,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {3378#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {3379#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:42,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {3379#(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; {3421#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:42,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {3421#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3370#false} is VALID [2022-04-08 10:01:42,120 INFO L272 TraceCheckUtils]: 14: Hoare triple {3370#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3370#false} is VALID [2022-04-08 10:01:42,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#false} ~cond := #in~cond; {3370#false} is VALID [2022-04-08 10:01:42,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#false} assume 0 == ~cond; {3370#false} is VALID [2022-04-08 10:01:42,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {3370#false} assume !false; {3370#false} is VALID [2022-04-08 10:01:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:42,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:42,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {3370#false} assume !false; {3370#false} is VALID [2022-04-08 10:01:42,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#false} assume 0 == ~cond; {3370#false} is VALID [2022-04-08 10:01:42,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#false} ~cond := #in~cond; {3370#false} is VALID [2022-04-08 10:01:42,262 INFO L272 TraceCheckUtils]: 14: Hoare triple {3370#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3370#false} is VALID [2022-04-08 10:01:42,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {3449#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3370#false} is VALID [2022-04-08 10:01:42,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {3453#(< 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; {3449#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:42,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {3457#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {3453#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:42,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {3457#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {3457#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:42,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {3464#(< 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; {3457#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:42,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {3468#(< 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; {3464#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:42,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {3472#(< 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; {3468#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:42,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {3476#(< 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; {3472#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:42,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {3369#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3476#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:42,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {3369#true} call #t~ret9 := main(); {3369#true} is VALID [2022-04-08 10:01:42,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3369#true} {3369#true} #50#return; {3369#true} is VALID [2022-04-08 10:01:42,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {3369#true} assume true; {3369#true} is VALID [2022-04-08 10:01:42,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {3369#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); {3369#true} is VALID [2022-04-08 10:01:42,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {3369#true} call ULTIMATE.init(); {3369#true} is VALID [2022-04-08 10:01:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:42,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450462040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:42,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:42,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 10:01:42,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:42,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951018319] [2022-04-08 10:01:42,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951018319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:42,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:42,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:01:42,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760937887] [2022-04-08 10:01:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:42,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:42,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:42,281 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:01:42,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:01:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:01:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:01:42,282 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:42,690 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 10:01:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:01:42,690 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-08 10:01:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-04-08 10:01:42,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2022-04-08 10:01:42,785 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:01:42,785 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:01:42,785 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 10:01:42,786 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:01:42,786 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:42,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 10:01:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-04-08 10:01:42,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:42,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:42,832 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:42,833 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:42,836 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 10:01:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 10:01:42,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:42,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:42,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 10:01:42,837 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-08 10:01:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:42,837 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 10:01:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 10:01:42,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:42,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:42,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:42,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 10:01:42,838 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2022-04-08 10:01:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:42,838 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 10:01:42,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:42,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 10:01:42,896 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:01:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:01:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:01:42,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:42,897 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:42,913 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:01:43,107 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:01:43,108 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -743682676, now seen corresponding path program 9 times [2022-04-08 10:01:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:43,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298490805] [2022-04-08 10:01:43,112 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:43,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash -743682676, now seen corresponding path program 10 times [2022-04-08 10:01:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:43,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244700454] [2022-04-08 10:01:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:43,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:43,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {3703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {3691#true} is VALID [2022-04-08 10:01:43,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-08 10:01:43,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-08 10:01:43,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {3691#true} call ULTIMATE.init(); {3703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:43,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {3703#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {3691#true} is VALID [2022-04-08 10:01:43,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-08 10:01:43,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-08 10:01:43,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret9 := main(); {3691#true} is VALID [2022-04-08 10:01:43,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {3691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3696#(= main_~y~0 0)} is VALID [2022-04-08 10:01:43,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {3696#(= 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; {3697#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:43,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {3697#(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; {3698#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:43,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {3698#(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; {3699#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:43,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3699#(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; {3700#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:43,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {3700#(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; {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:43,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:43,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3702#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:43,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3702#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3692#false} is VALID [2022-04-08 10:01:43,205 INFO L272 TraceCheckUtils]: 14: Hoare triple {3692#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3692#false} is VALID [2022-04-08 10:01:43,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {3692#false} ~cond := #in~cond; {3692#false} is VALID [2022-04-08 10:01:43,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {3692#false} assume 0 == ~cond; {3692#false} is VALID [2022-04-08 10:01:43,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-08 10:01:43,206 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:01:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:43,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244700454] [2022-04-08 10:01:43,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244700454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:43,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079208950] [2022-04-08 10:01:43,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:43,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:43,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:43,213 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:01:43,214 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:01:43,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:43,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:43,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:01:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:43,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:43,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {3691#true} call ULTIMATE.init(); {3691#true} is VALID [2022-04-08 10:01:43,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {3691#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); {3691#true} is VALID [2022-04-08 10:01:43,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-08 10:01:43,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-08 10:01:43,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret9 := main(); {3691#true} is VALID [2022-04-08 10:01:43,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {3691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3696#(= main_~y~0 0)} is VALID [2022-04-08 10:01:43,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {3696#(= 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; {3697#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:43,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {3697#(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; {3698#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:43,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {3698#(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; {3699#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:43,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {3699#(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; {3700#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:43,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {3700#(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; {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:43,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:43,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3743#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:43,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {3743#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3692#false} is VALID [2022-04-08 10:01:43,424 INFO L272 TraceCheckUtils]: 14: Hoare triple {3692#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3692#false} is VALID [2022-04-08 10:01:43,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {3692#false} ~cond := #in~cond; {3692#false} is VALID [2022-04-08 10:01:43,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {3692#false} assume 0 == ~cond; {3692#false} is VALID [2022-04-08 10:01:43,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-08 10:01:43,425 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:01:43,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:43,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {3692#false} assume !false; {3692#false} is VALID [2022-04-08 10:01:43,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {3692#false} assume 0 == ~cond; {3692#false} is VALID [2022-04-08 10:01:43,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {3692#false} ~cond := #in~cond; {3692#false} is VALID [2022-04-08 10:01:43,583 INFO L272 TraceCheckUtils]: 14: Hoare triple {3692#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3692#false} is VALID [2022-04-08 10:01:43,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {3771#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3692#false} is VALID [2022-04-08 10:01:43,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {3775#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3771#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:43,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {3775#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3775#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:43,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {3782#(< 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; {3775#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:43,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {3786#(< 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; {3782#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:43,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {3790#(< 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; {3786#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:43,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {3794#(< 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; {3790#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:43,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {3798#(< 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; {3794#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:01:43,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {3691#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3798#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:01:43,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {3691#true} call #t~ret9 := main(); {3691#true} is VALID [2022-04-08 10:01:43,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3691#true} {3691#true} #50#return; {3691#true} is VALID [2022-04-08 10:01:43,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {3691#true} assume true; {3691#true} is VALID [2022-04-08 10:01:43,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {3691#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); {3691#true} is VALID [2022-04-08 10:01:43,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {3691#true} call ULTIMATE.init(); {3691#true} is VALID [2022-04-08 10:01:43,601 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:01:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079208950] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:43,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:43,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 10:01:43,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:43,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298490805] [2022-04-08 10:01:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298490805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:43,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:43,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:01:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883136535] [2022-04-08 10:01:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:43,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:43,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:43,618 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:01:43,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:01:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:43,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:01:43,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:01:43,620 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:44,031 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-08 10:01:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:01:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 10:01:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-04-08 10:01:44,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2022-04-08 10:01:44,069 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:01:44,070 INFO L225 Difference]: With dead ends: 40 [2022-04-08 10:01:44,070 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 10:01:44,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 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:01:44,071 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:44,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 57 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 10:01:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-04-08 10:01:44,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:44,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:44,104 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:44,104 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:44,104 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 10:01:44,105 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 10:01:44,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:44,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:44,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 10:01:44,105 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 10:01:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:44,105 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 10:01:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 10:01:44,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:44,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:44,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:44,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-08 10:01:44,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2022-04-08 10:01:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:44,107 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-08 10:01:44,107 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:01:44,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-08 10:01:44,135 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:01:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 10:01:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:01:44,136 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:44,136 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:44,155 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:01:44,353 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:01:44,353 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:44,353 INFO L85 PathProgramCache]: Analyzing trace with hash -21737866, now seen corresponding path program 17 times [2022-04-08 10:01:44,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:44,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409834901] [2022-04-08 10:01:44,363 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:44,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash -21737866, now seen corresponding path program 18 times [2022-04-08 10:01:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:44,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146658548] [2022-04-08 10:01:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:44,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {4047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4035#true} is VALID [2022-04-08 10:01:44,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-08 10:01:44,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-08 10:01:44,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} call ULTIMATE.init(); {4047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:44,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {4047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4035#true} is VALID [2022-04-08 10:01:44,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-08 10:01:44,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-08 10:01:44,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} call #t~ret9 := main(); {4035#true} is VALID [2022-04-08 10:01:44,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {4035#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:44,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:44,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:44,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:44,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:44,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:44,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:44,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:44,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4044#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:44,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {4044#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {4044#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:44,490 INFO L272 TraceCheckUtils]: 15: Hoare triple {4044#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:01:44,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {4045#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4046#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:01:44,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {4046#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4036#false} is VALID [2022-04-08 10:01:44,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2022-04-08 10:01:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:44,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146658548] [2022-04-08 10:01:44,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146658548] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:44,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583085008] [2022-04-08 10:01:44,491 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:01:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:44,492 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:01:44,493 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:01:44,544 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:01:44,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:44,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:01:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:44,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:44,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} call ULTIMATE.init(); {4035#true} is VALID [2022-04-08 10:01:44,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {4035#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); {4035#true} is VALID [2022-04-08 10:01:44,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-08 10:01:44,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-08 10:01:44,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} call #t~ret9 := main(); {4035#true} is VALID [2022-04-08 10:01:44,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {4035#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:44,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:44,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:44,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:44,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !(~x~0 % 4294967296 > 0); {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:44,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} ~z~0 := ~y~0; {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:44,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {4043#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:44,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:44,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {4041#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:44,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:44,677 INFO L272 TraceCheckUtils]: 15: Hoare triple {4040#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:44,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {4096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:44,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {4100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4036#false} is VALID [2022-04-08 10:01:44,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2022-04-08 10:01:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:44,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:44,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2022-04-08 10:01:44,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {4100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4036#false} is VALID [2022-04-08 10:01:44,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {4096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:44,816 INFO L272 TraceCheckUtils]: 15: Hoare triple {4116#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:44,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {4116#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4116#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:44,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {4123#(= (mod main_~n~0 4294967296) (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; {4116#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:44,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {4127#(= (mod main_~n~0 4294967296) (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; {4123#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:44,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {4131#(= (mod (+ main_~x~0 3) 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; {4127#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:01:44,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {4131#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} ~z~0 := ~y~0; {4131#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:01:44,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {4131#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4131#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:01:44,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {4127#(= (mod main_~n~0 4294967296) (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; {4131#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:01:44,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {4123#(= (mod main_~n~0 4294967296) (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; {4127#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:01:44,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {4116#(= (mod main_~n~0 4294967296) (mod 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; {4123#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:44,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {4035#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4116#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:44,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {4035#true} call #t~ret9 := main(); {4035#true} is VALID [2022-04-08 10:01:44,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4035#true} {4035#true} #50#return; {4035#true} is VALID [2022-04-08 10:01:44,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {4035#true} assume true; {4035#true} is VALID [2022-04-08 10:01:44,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {4035#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); {4035#true} is VALID [2022-04-08 10:01:44,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {4035#true} call ULTIMATE.init(); {4035#true} is VALID [2022-04-08 10:01:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:44,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583085008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:44,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:44,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-08 10:01:44,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:44,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409834901] [2022-04-08 10:01:44,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409834901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:44,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:44,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:01:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282577863] [2022-04-08 10:01:44,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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:01:44,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:44,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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:01:44,840 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:01:44,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:01:44,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:01:44,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:01:44,841 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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:01:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:45,195 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 10:01:45,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:01:45,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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:01:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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:01:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-08 10:01:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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:01:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-08 10:01:45,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-08 10:01:45,222 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:01:45,222 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:01:45,222 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 10:01:45,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:01:45,223 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:45,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 48 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:45,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 10:01:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-08 10:01:45,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:45,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:45,279 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:45,279 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:45,280 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 10:01:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 10:01:45,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:45,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:45,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 10:01:45,280 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 10:01:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:45,280 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-08 10:01:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 10:01:45,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:45,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:45,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:45,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 10:01:45,282 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-08 10:01:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:45,282 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 10:01:45,282 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 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:01:45,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 10:01:45,316 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:01:45,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:01:45,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:45,317 INFO L499 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:45,335 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:01:45,525 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:01:45,526 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:45,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash -960363817, now seen corresponding path program 19 times [2022-04-08 10:01:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:45,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1175856226] [2022-04-08 10:01:45,528 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:45,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -960363817, now seen corresponding path program 20 times [2022-04-08 10:01:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:45,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370137538] [2022-04-08 10:01:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:45,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:45,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4359#true} is VALID [2022-04-08 10:01:45,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-08 10:01:45,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-08 10:01:45,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {4359#true} call ULTIMATE.init(); {4372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:45,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4359#true} is VALID [2022-04-08 10:01:45,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-08 10:01:45,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-08 10:01:45,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {4359#true} call #t~ret9 := main(); {4359#true} is VALID [2022-04-08 10:01:45,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {4359#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4364#(= main_~y~0 0)} is VALID [2022-04-08 10:01:45,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {4364#(= 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; {4365#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:45,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {4365#(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; {4366#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:45,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {4366#(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; {4367#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:45,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {4367#(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; {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:45,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:45,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {4369#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:45,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {4369#(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; {4370#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:45,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {4370#(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; {4371#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:45,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {4371#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4360#false} is VALID [2022-04-08 10:01:45,629 INFO L272 TraceCheckUtils]: 15: Hoare triple {4360#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4360#false} is VALID [2022-04-08 10:01:45,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#false} ~cond := #in~cond; {4360#false} is VALID [2022-04-08 10:01:45,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {4360#false} assume 0 == ~cond; {4360#false} is VALID [2022-04-08 10:01:45,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {4360#false} assume !false; {4360#false} is VALID [2022-04-08 10:01:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:45,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370137538] [2022-04-08 10:01:45,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370137538] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:45,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826195961] [2022-04-08 10:01:45,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:45,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:45,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:45,636 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:01:45,636 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:01:45,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:45,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:45,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:01:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:45,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:45,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {4359#true} call ULTIMATE.init(); {4359#true} is VALID [2022-04-08 10:01:45,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {4359#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); {4359#true} is VALID [2022-04-08 10:01:45,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-08 10:01:45,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-08 10:01:45,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {4359#true} call #t~ret9 := main(); {4359#true} is VALID [2022-04-08 10:01:45,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {4359#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4364#(= main_~y~0 0)} is VALID [2022-04-08 10:01:45,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {4364#(= 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; {4365#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:45,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {4365#(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; {4366#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:45,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {4366#(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; {4367#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:45,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {4367#(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; {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:45,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:45,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {4368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {4369#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:45,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {4369#(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; {4370#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:45,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {4370#(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; {4415#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:45,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {4415#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4360#false} is VALID [2022-04-08 10:01:45,840 INFO L272 TraceCheckUtils]: 15: Hoare triple {4360#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4360#false} is VALID [2022-04-08 10:01:45,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#false} ~cond := #in~cond; {4360#false} is VALID [2022-04-08 10:01:45,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {4360#false} assume 0 == ~cond; {4360#false} is VALID [2022-04-08 10:01:45,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {4360#false} assume !false; {4360#false} is VALID [2022-04-08 10:01:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:45,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:45,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {4360#false} assume !false; {4360#false} is VALID [2022-04-08 10:01:45,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {4360#false} assume 0 == ~cond; {4360#false} is VALID [2022-04-08 10:01:45,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {4360#false} ~cond := #in~cond; {4360#false} is VALID [2022-04-08 10:01:45,989 INFO L272 TraceCheckUtils]: 15: Hoare triple {4360#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4360#false} is VALID [2022-04-08 10:01:45,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {4443#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4360#false} is VALID [2022-04-08 10:01:46,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {4447#(< 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; {4443#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:46,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {4451#(< 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; {4447#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:46,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {4455#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {4451#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:46,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {4455#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4455#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:46,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {4462#(< 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; {4455#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:46,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {4466#(< 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; {4462#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:46,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {4470#(< 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; {4466#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:46,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {4474#(< 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; {4470#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:46,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {4359#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4474#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:46,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {4359#true} call #t~ret9 := main(); {4359#true} is VALID [2022-04-08 10:01:46,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4359#true} {4359#true} #50#return; {4359#true} is VALID [2022-04-08 10:01:46,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {4359#true} assume true; {4359#true} is VALID [2022-04-08 10:01:46,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {4359#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); {4359#true} is VALID [2022-04-08 10:01:46,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {4359#true} call ULTIMATE.init(); {4359#true} is VALID [2022-04-08 10:01:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:46,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826195961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:46,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:46,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:01:46,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:46,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1175856226] [2022-04-08 10:01:46,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1175856226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:46,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:46,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:01:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838850342] [2022-04-08 10:01:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:46,011 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:46,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:46,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:46,023 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:01:46,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:01:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:01:46,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:01:46,023 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:46,457 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-08 10:01:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:01:46,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-08 10:01:46,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-08 10:01:46,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-08 10:01:46,489 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:01:46,489 INFO L225 Difference]: With dead ends: 40 [2022-04-08 10:01:46,489 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 10:01:46,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:01:46,490 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:46,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 49 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 10:01:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-04-08 10:01:46,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:46,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:46,554 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:46,554 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:46,555 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 10:01:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:01:46,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:46,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:46,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 10:01:46,555 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 10:01:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:46,556 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 10:01:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:01:46,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:46,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:46,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:46,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 10:01:46,557 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-08 10:01:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:46,557 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 10:01:46,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:46,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 10:01:46,593 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:01:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:01:46,593 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:46,593 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:46,611 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:01:46,802 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:01:46,802 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1544831402, now seen corresponding path program 21 times [2022-04-08 10:01:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:46,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186452830] [2022-04-08 10:01:46,807 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:46,807 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1544831402, now seen corresponding path program 22 times [2022-04-08 10:01:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:46,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69957135] [2022-04-08 10:01:46,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:46,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {4732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4719#true} is VALID [2022-04-08 10:01:46,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-08 10:01:46,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-08 10:01:46,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {4719#true} call ULTIMATE.init(); {4732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:46,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {4732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {4719#true} is VALID [2022-04-08 10:01:46,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-08 10:01:46,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-08 10:01:46,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret9 := main(); {4719#true} is VALID [2022-04-08 10:01:46,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {4719#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4724#(= main_~y~0 0)} is VALID [2022-04-08 10:01:46,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {4724#(= 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; {4725#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:46,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {4725#(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; {4726#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:46,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {4726#(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; {4727#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:46,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {4727#(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; {4728#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:46,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {4728#(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; {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:46,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:46,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4730#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:46,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {4730#(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; {4731#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:46,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {4731#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4720#false} is VALID [2022-04-08 10:01:46,944 INFO L272 TraceCheckUtils]: 15: Hoare triple {4720#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4720#false} is VALID [2022-04-08 10:01:46,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {4720#false} ~cond := #in~cond; {4720#false} is VALID [2022-04-08 10:01:46,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {4720#false} assume 0 == ~cond; {4720#false} is VALID [2022-04-08 10:01:46,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-08 10:01:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:46,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:46,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69957135] [2022-04-08 10:01:46,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69957135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:46,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058284928] [2022-04-08 10:01:46,946 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:46,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:46,947 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:01:46,967 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:01:46,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:46,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:46,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:01:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:47,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:47,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {4719#true} call ULTIMATE.init(); {4719#true} is VALID [2022-04-08 10:01:47,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {4719#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); {4719#true} is VALID [2022-04-08 10:01:47,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-08 10:01:47,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-08 10:01:47,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret9 := main(); {4719#true} is VALID [2022-04-08 10:01:47,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {4719#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4724#(= main_~y~0 0)} is VALID [2022-04-08 10:01:47,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {4724#(= 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; {4725#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:47,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {4725#(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; {4726#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:47,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {4726#(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; {4727#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:47,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {4727#(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; {4728#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:47,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {4728#(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; {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:47,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:47,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {4729#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4730#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:47,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {4730#(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; {4775#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:47,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {4775#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {4720#false} is VALID [2022-04-08 10:01:47,219 INFO L272 TraceCheckUtils]: 15: Hoare triple {4720#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4720#false} is VALID [2022-04-08 10:01:47,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {4720#false} ~cond := #in~cond; {4720#false} is VALID [2022-04-08 10:01:47,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {4720#false} assume 0 == ~cond; {4720#false} is VALID [2022-04-08 10:01:47,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-08 10:01:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:47,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:47,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-08 10:01:47,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {4720#false} assume 0 == ~cond; {4720#false} is VALID [2022-04-08 10:01:47,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {4720#false} ~cond := #in~cond; {4720#false} is VALID [2022-04-08 10:01:47,356 INFO L272 TraceCheckUtils]: 15: Hoare triple {4720#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4720#false} is VALID [2022-04-08 10:01:47,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {4803#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4720#false} is VALID [2022-04-08 10:01:47,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {4807#(< 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; {4803#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:47,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {4811#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {4807#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:47,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {4811#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {4811#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:47,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {4818#(< 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; {4811#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:47,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {4822#(< 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; {4818#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:47,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {4826#(< 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; {4822#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:47,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {4830#(< 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; {4826#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:47,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {4834#(< 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; {4830#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:47,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {4719#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4834#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:01:47,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret9 := main(); {4719#true} is VALID [2022-04-08 10:01:47,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #50#return; {4719#true} is VALID [2022-04-08 10:01:47,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-08 10:01:47,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {4719#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); {4719#true} is VALID [2022-04-08 10:01:47,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {4719#true} call ULTIMATE.init(); {4719#true} is VALID [2022-04-08 10:01:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:47,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058284928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:47,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:47,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:01:47,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:47,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186452830] [2022-04-08 10:01:47,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186452830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:47,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:47,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:01:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785257586] [2022-04-08 10:01:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:47,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:47,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:47,371 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:01:47,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:01:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:01:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:01:47,372 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:47,839 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-04-08 10:01:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:01:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-08 10:01:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-08 10:01:47,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-08 10:01:47,865 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:01:47,865 INFO L225 Difference]: With dead ends: 43 [2022-04-08 10:01:47,865 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 10:01:47,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:01:47,866 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:47,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 10:01:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2022-04-08 10:01:47,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:47,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:47,909 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:47,909 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:47,920 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 10:01:47,920 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 10:01:47,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:47,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:47,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 10:01:47,921 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-08 10:01:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:47,922 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 10:01:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 10:01:47,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:47,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:47,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:47,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 10:01:47,922 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-08 10:01:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:47,922 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 10:01:47,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:47,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 10:01:47,966 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:01:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:47,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:01:47,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:47,967 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:47,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 10:01:48,187 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:01:48,188 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 653072119, now seen corresponding path program 11 times [2022-04-08 10:01:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1365048787] [2022-04-08 10:01:48,190 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:48,190 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 653072119, now seen corresponding path program 12 times [2022-04-08 10:01:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:48,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917717662] [2022-04-08 10:01:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:48,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:48,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {5102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {5089#true} is VALID [2022-04-08 10:01:48,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-08 10:01:48,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-08 10:01:48,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {5089#true} call ULTIMATE.init(); {5102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:48,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {5102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {5089#true} is VALID [2022-04-08 10:01:48,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-08 10:01:48,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-08 10:01:48,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {5089#true} call #t~ret9 := main(); {5089#true} is VALID [2022-04-08 10:01:48,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {5089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5094#(= main_~y~0 0)} is VALID [2022-04-08 10:01:48,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {5094#(= 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; {5095#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:48,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {5095#(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; {5096#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:48,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {5096#(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; {5097#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:48,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {5097#(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; {5098#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:48,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {5098#(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; {5099#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:48,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {5099#(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; {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:48,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:48,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5101#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:01:48,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {5101#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5090#false} is VALID [2022-04-08 10:01:48,309 INFO L272 TraceCheckUtils]: 15: Hoare triple {5090#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5090#false} is VALID [2022-04-08 10:01:48,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {5090#false} ~cond := #in~cond; {5090#false} is VALID [2022-04-08 10:01:48,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {5090#false} assume 0 == ~cond; {5090#false} is VALID [2022-04-08 10:01:48,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {5090#false} assume !false; {5090#false} is VALID [2022-04-08 10:01:48,309 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:01:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:48,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917717662] [2022-04-08 10:01:48,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917717662] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:48,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142013549] [2022-04-08 10:01:48,309 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:01:48,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:48,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:48,310 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:01:48,330 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:01:48,376 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:01:48,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:48,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:01:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:48,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:48,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {5089#true} call ULTIMATE.init(); {5089#true} is VALID [2022-04-08 10:01:48,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {5089#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); {5089#true} is VALID [2022-04-08 10:01:48,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-08 10:01:48,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-08 10:01:48,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {5089#true} call #t~ret9 := main(); {5089#true} is VALID [2022-04-08 10:01:48,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {5089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5094#(= main_~y~0 0)} is VALID [2022-04-08 10:01:48,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {5094#(= 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; {5095#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:48,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {5095#(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; {5096#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:48,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {5096#(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; {5097#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:48,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {5097#(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; {5098#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:48,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {5098#(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; {5099#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:48,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {5099#(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; {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:48,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:48,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {5100#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5145#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:01:48,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {5145#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5090#false} is VALID [2022-04-08 10:01:48,573 INFO L272 TraceCheckUtils]: 15: Hoare triple {5090#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5090#false} is VALID [2022-04-08 10:01:48,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {5090#false} ~cond := #in~cond; {5090#false} is VALID [2022-04-08 10:01:48,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {5090#false} assume 0 == ~cond; {5090#false} is VALID [2022-04-08 10:01:48,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {5090#false} assume !false; {5090#false} is VALID [2022-04-08 10:01:48,573 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:01:48,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:48,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {5090#false} assume !false; {5090#false} is VALID [2022-04-08 10:01:48,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {5090#false} assume 0 == ~cond; {5090#false} is VALID [2022-04-08 10:01:48,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {5090#false} ~cond := #in~cond; {5090#false} is VALID [2022-04-08 10:01:48,766 INFO L272 TraceCheckUtils]: 15: Hoare triple {5090#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5090#false} is VALID [2022-04-08 10:01:48,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {5173#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5090#false} is VALID [2022-04-08 10:01:48,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {5177#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {5173#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:48,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {5177#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5177#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:48,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {5184#(< 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; {5177#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:48,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {5188#(< 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; {5184#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:48,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {5192#(< 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; {5188#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:48,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {5196#(< 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; {5192#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:48,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {5200#(< 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; {5196#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:01:48,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {5204#(< 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; {5200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:01:48,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {5089#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5204#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:01:48,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {5089#true} call #t~ret9 := main(); {5089#true} is VALID [2022-04-08 10:01:48,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5089#true} {5089#true} #50#return; {5089#true} is VALID [2022-04-08 10:01:48,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {5089#true} assume true; {5089#true} is VALID [2022-04-08 10:01:48,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {5089#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); {5089#true} is VALID [2022-04-08 10:01:48,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {5089#true} call ULTIMATE.init(); {5089#true} is VALID [2022-04-08 10:01:48,771 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:01:48,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142013549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:48,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:48,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:01:48,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:48,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1365048787] [2022-04-08 10:01:48,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1365048787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:48,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:48,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:01:48,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262702053] [2022-04-08 10:01:48,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:48,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:48,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:48,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:48,782 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:01:48,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:01:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:01:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:01:48,784 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:49,429 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-08 10:01:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:01:49,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2022-04-08 10:01:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2022-04-08 10:01:49,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 48 transitions. [2022-04-08 10:01:49,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:49,466 INFO L225 Difference]: With dead ends: 48 [2022-04-08 10:01:49,466 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 10:01:49,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:01:49,466 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:49,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:01:49,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 10:01:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-04-08 10:01:49,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:49,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:49,525 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:49,525 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:49,526 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-08 10:01:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-08 10:01:49,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:49,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:49,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 10:01:49,528 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 10:01:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:49,529 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-08 10:01:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-08 10:01:49,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:49,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:49,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:49,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-08 10:01:49,530 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 19 [2022-04-08 10:01:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:49,531 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-08 10:01:49,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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:01:49,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-08 10:01:49,563 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:01:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-08 10:01:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:01:49,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:49,563 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:49,580 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:01:49,779 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:01:49,780 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:49,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -639378772, now seen corresponding path program 23 times [2022-04-08 10:01:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:49,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706830572] [2022-04-08 10:01:49,801 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:49,801 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash -639378772, now seen corresponding path program 24 times [2022-04-08 10:01:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:49,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122614572] [2022-04-08 10:01:49,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:49,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {5494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {5481#true} is VALID [2022-04-08 10:01:49,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-08 10:01:49,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-08 10:01:49,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {5481#true} call ULTIMATE.init(); {5494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:49,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {5494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {5481#true} is VALID [2022-04-08 10:01:49,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-08 10:01:49,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-08 10:01:49,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {5481#true} call #t~ret9 := main(); {5481#true} is VALID [2022-04-08 10:01:49,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {5481#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5486#(= main_~y~0 0)} is VALID [2022-04-08 10:01:49,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {5486#(= 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; {5487#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:49,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {5487#(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; {5488#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:49,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {5488#(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; {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:49,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:49,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5490#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:49,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {5490#(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; {5491#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:49,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#(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; {5492#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:49,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {5492#(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; {5493#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:01:49,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {5493#(and (<= main_~z~0 0) (<= 0 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; {5482#false} is VALID [2022-04-08 10:01:49,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {5482#false} assume !(~z~0 % 4294967296 > 0); {5482#false} is VALID [2022-04-08 10:01:49,925 INFO L272 TraceCheckUtils]: 16: Hoare triple {5482#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5482#false} is VALID [2022-04-08 10:01:49,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {5482#false} ~cond := #in~cond; {5482#false} is VALID [2022-04-08 10:01:49,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {5482#false} assume 0 == ~cond; {5482#false} is VALID [2022-04-08 10:01:49,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {5482#false} assume !false; {5482#false} is VALID [2022-04-08 10:01:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:49,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122614572] [2022-04-08 10:01:49,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122614572] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:49,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478222478] [2022-04-08 10:01:49,925 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:01:49,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:49,926 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:01:49,927 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:01:49,967 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:01:49,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:49,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:01:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:49,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:50,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {5481#true} call ULTIMATE.init(); {5481#true} is VALID [2022-04-08 10:01:50,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {5481#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); {5481#true} is VALID [2022-04-08 10:01:50,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-08 10:01:50,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-08 10:01:50,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {5481#true} call #t~ret9 := main(); {5481#true} is VALID [2022-04-08 10:01:50,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {5481#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5486#(= main_~y~0 0)} is VALID [2022-04-08 10:01:50,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {5486#(= 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; {5487#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:50,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {5487#(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; {5488#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:50,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {5488#(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; {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:50,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:50,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {5489#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {5490#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:50,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {5490#(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; {5491#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:50,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {5491#(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; {5492#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:50,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {5492#(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; {5493#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:01:50,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {5493#(and (<= main_~z~0 0) (<= 0 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; {5540#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:01:50,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {5540#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {5482#false} is VALID [2022-04-08 10:01:50,181 INFO L272 TraceCheckUtils]: 16: Hoare triple {5482#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5482#false} is VALID [2022-04-08 10:01:50,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {5482#false} ~cond := #in~cond; {5482#false} is VALID [2022-04-08 10:01:50,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {5482#false} assume 0 == ~cond; {5482#false} is VALID [2022-04-08 10:01:50,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {5482#false} assume !false; {5482#false} is VALID [2022-04-08 10:01:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:50,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:50,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {5482#false} assume !false; {5482#false} is VALID [2022-04-08 10:01:50,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {5482#false} assume 0 == ~cond; {5482#false} is VALID [2022-04-08 10:01:50,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {5482#false} ~cond := #in~cond; {5482#false} is VALID [2022-04-08 10:01:50,363 INFO L272 TraceCheckUtils]: 16: Hoare triple {5482#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5482#false} is VALID [2022-04-08 10:01:50,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5482#false} is VALID [2022-04-08 10:01:50,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {5572#(< 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; {5568#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:50,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {5576#(< 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; {5572#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:50,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {5580#(< 0 (mod (+ main_~z~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; {5576#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:50,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#(< 0 (mod (+ 4294967292 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; {5580#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:50,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {5588#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {5584#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:01:50,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {5588#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5588#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:01:50,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {5595#(< 0 (mod (+ main_~y~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; {5588#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:01:50,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#(< 0 (mod (+ main_~y~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; {5595#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:50,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#(< 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; {5599#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:50,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {5481#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5603#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:50,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {5481#true} call #t~ret9 := main(); {5481#true} is VALID [2022-04-08 10:01:50,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5481#true} {5481#true} #50#return; {5481#true} is VALID [2022-04-08 10:01:50,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {5481#true} assume true; {5481#true} is VALID [2022-04-08 10:01:50,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {5481#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); {5481#true} is VALID [2022-04-08 10:01:50,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {5481#true} call ULTIMATE.init(); {5481#true} is VALID [2022-04-08 10:01:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:50,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478222478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:50,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:50,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-04-08 10:01:50,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:50,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706830572] [2022-04-08 10:01:50,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706830572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:50,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:50,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:01:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528893161] [2022-04-08 10:01:50,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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:01:50,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:50,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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:01:50,384 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:01:50,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:01:50,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:01:50,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:01:50,385 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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:01:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:50,780 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-08 10:01:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:01:50,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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:01:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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:01:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-08 10:01:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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:01:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2022-04-08 10:01:50,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 31 transitions. [2022-04-08 10:01:50,803 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:01:50,803 INFO L225 Difference]: With dead ends: 38 [2022-04-08 10:01:50,804 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 10:01:50,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:01:50,804 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:50,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 10:01:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 10:01:50,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:50,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:50,855 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:50,855 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:50,855 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 10:01:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:50,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:50,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:50,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:01:50,856 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 10:01:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:50,856 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 10:01:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:50,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:50,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:50,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:50,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 10:01:50,857 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2022-04-08 10:01:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:50,857 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 10:01:50,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 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:01:50,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 10:01:50,897 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:01:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 10:01:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:01:50,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:50,898 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:50,917 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:01:51,111 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:01:51,112 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:51,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:51,112 INFO L85 PathProgramCache]: Analyzing trace with hash 327987819, now seen corresponding path program 25 times [2022-04-08 10:01:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:51,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587309670] [2022-04-08 10:01:51,160 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:51,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash 327987819, now seen corresponding path program 26 times [2022-04-08 10:01:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:51,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920776310] [2022-04-08 10:01:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:51,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:51,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {5838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {5824#true} is VALID [2022-04-08 10:01:51,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-08 10:01:51,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-08 10:01:51,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {5824#true} call ULTIMATE.init(); {5838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:51,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {5838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {5824#true} is VALID [2022-04-08 10:01:51,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-08 10:01:51,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-08 10:01:51,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {5824#true} call #t~ret9 := main(); {5824#true} is VALID [2022-04-08 10:01:51,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {5824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5829#(= main_~y~0 0)} is VALID [2022-04-08 10:01:51,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {5829#(= 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; {5830#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:51,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {5830#(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; {5831#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:51,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {5831#(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; {5832#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:51,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {5832#(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; {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:51,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:51,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {5834#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:51,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {5834#(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; {5835#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:51,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {5835#(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; {5836#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:51,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {5836#(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; {5837#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:51,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {5837#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5825#false} is VALID [2022-04-08 10:01:51,310 INFO L272 TraceCheckUtils]: 16: Hoare triple {5825#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5825#false} is VALID [2022-04-08 10:01:51,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {5825#false} ~cond := #in~cond; {5825#false} is VALID [2022-04-08 10:01:51,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {5825#false} assume 0 == ~cond; {5825#false} is VALID [2022-04-08 10:01:51,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {5825#false} assume !false; {5825#false} is VALID [2022-04-08 10:01:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:51,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920776310] [2022-04-08 10:01:51,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920776310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:51,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386114622] [2022-04-08 10:01:51,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:51,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:51,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:51,311 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:01:51,318 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:01:51,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:51,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:51,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:01:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:51,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:51,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {5824#true} call ULTIMATE.init(); {5824#true} is VALID [2022-04-08 10:01:51,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {5824#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); {5824#true} is VALID [2022-04-08 10:01:51,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-08 10:01:51,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-08 10:01:51,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {5824#true} call #t~ret9 := main(); {5824#true} is VALID [2022-04-08 10:01:51,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {5824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5829#(= main_~y~0 0)} is VALID [2022-04-08 10:01:51,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {5829#(= 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; {5830#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:51,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {5830#(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; {5831#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:51,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {5831#(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; {5832#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:51,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {5832#(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; {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:51,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:51,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {5833#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {5834#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:51,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {5834#(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; {5835#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:51,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {5835#(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; {5836#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:51,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {5836#(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; {5884#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:01:51,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {5884#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5825#false} is VALID [2022-04-08 10:01:51,550 INFO L272 TraceCheckUtils]: 16: Hoare triple {5825#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5825#false} is VALID [2022-04-08 10:01:51,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {5825#false} ~cond := #in~cond; {5825#false} is VALID [2022-04-08 10:01:51,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {5825#false} assume 0 == ~cond; {5825#false} is VALID [2022-04-08 10:01:51,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {5825#false} assume !false; {5825#false} is VALID [2022-04-08 10:01:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:51,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:51,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {5825#false} assume !false; {5825#false} is VALID [2022-04-08 10:01:51,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {5825#false} assume 0 == ~cond; {5825#false} is VALID [2022-04-08 10:01:51,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {5825#false} ~cond := #in~cond; {5825#false} is VALID [2022-04-08 10:01:51,722 INFO L272 TraceCheckUtils]: 16: Hoare triple {5825#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5825#false} is VALID [2022-04-08 10:01:51,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {5912#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5825#false} is VALID [2022-04-08 10:01:51,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {5916#(< 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; {5912#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:51,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {5920#(< 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; {5916#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:51,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {5924#(< 0 (mod (+ main_~z~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; {5920#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:51,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {5928#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {5924#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:51,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {5928#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {5928#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:51,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {5935#(< 0 (mod (+ main_~y~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; {5928#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:51,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {5939#(< 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; {5935#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:51,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {5943#(< 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; {5939#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:51,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {5947#(< 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; {5943#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:51,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {5824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5947#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:51,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {5824#true} call #t~ret9 := main(); {5824#true} is VALID [2022-04-08 10:01:51,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5824#true} {5824#true} #50#return; {5824#true} is VALID [2022-04-08 10:01:51,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {5824#true} assume true; {5824#true} is VALID [2022-04-08 10:01:51,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {5824#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); {5824#true} is VALID [2022-04-08 10:01:51,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {5824#true} call ULTIMATE.init(); {5824#true} is VALID [2022-04-08 10:01:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:51,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386114622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:51,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:51,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:01:51,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:51,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587309670] [2022-04-08 10:01:51,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587309670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:51,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:51,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:01:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580226375] [2022-04-08 10:01:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:51,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:51,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:51,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:51,739 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:01:51,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:01:51,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:51,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:01:51,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:01:51,740 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:52,014 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-08 10:01:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:01:52,014 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-08 10:01:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-08 10:01:52,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2022-04-08 10:01:52,053 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:01:52,054 INFO L225 Difference]: With dead ends: 37 [2022-04-08 10:01:52,054 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:01:52,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:01:52,055 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:52,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 46 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:01:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-04-08 10:01:52,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:52,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:52,115 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:52,115 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:52,116 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 10:01:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:01:52,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:52,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:52,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:01:52,116 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 10:01:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:52,116 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-08 10:01:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:01:52,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:52,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:52,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:52,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-08 10:01:52,117 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-04-08 10:01:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:52,117 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-08 10:01:52,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:52,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-08 10:01:52,158 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:01:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-08 10:01:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:01:52,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:52,159 INFO L499 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:52,177 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:01:52,367 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:01:52,367 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -610638132, now seen corresponding path program 27 times [2022-04-08 10:01:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1575267941] [2022-04-08 10:01:52,370 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:52,371 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash -610638132, now seen corresponding path program 28 times [2022-04-08 10:01:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:52,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365420332] [2022-04-08 10:01:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:52,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {6194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {6180#true} is VALID [2022-04-08 10:01:52,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-08 10:01:52,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-08 10:01:52,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:52,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {6194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {6180#true} is VALID [2022-04-08 10:01:52,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-08 10:01:52,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-08 10:01:52,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret9 := main(); {6180#true} is VALID [2022-04-08 10:01:52,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {6180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6185#(= main_~y~0 0)} is VALID [2022-04-08 10:01:52,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {6185#(= 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; {6186#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:52,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {6186#(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; {6187#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:52,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {6187#(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; {6188#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:52,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {6188#(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; {6189#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:52,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {6189#(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; {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:52,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:52,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {6191#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:52,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {6191#(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; {6192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:52,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {6192#(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; {6193#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:52,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {6193#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-08 10:01:52,537 INFO L272 TraceCheckUtils]: 16: Hoare triple {6181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6181#false} is VALID [2022-04-08 10:01:52,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-08 10:01:52,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-08 10:01:52,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-08 10:01:52,537 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:01:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:52,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365420332] [2022-04-08 10:01:52,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365420332] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:52,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299673049] [2022-04-08 10:01:52,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:52,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:52,538 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:01:52,540 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:01:52,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:52,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:52,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:01:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:52,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:52,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6180#true} is VALID [2022-04-08 10:01:52,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {6180#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); {6180#true} is VALID [2022-04-08 10:01:52,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-08 10:01:52,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-08 10:01:52,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret9 := main(); {6180#true} is VALID [2022-04-08 10:01:52,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {6180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6185#(= main_~y~0 0)} is VALID [2022-04-08 10:01:52,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {6185#(= 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; {6186#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:52,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {6186#(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; {6187#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:52,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {6187#(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; {6188#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:52,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {6188#(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; {6189#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:52,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {6189#(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; {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:52,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:52,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {6190#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {6191#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:52,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {6191#(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; {6192#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:52,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {6192#(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; {6240#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:52,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {6240#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-08 10:01:52,811 INFO L272 TraceCheckUtils]: 16: Hoare triple {6181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6181#false} is VALID [2022-04-08 10:01:52,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-08 10:01:52,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-08 10:01:52,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-08 10:01:52,812 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:01:52,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:52,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#false} assume !false; {6181#false} is VALID [2022-04-08 10:01:52,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#false} assume 0 == ~cond; {6181#false} is VALID [2022-04-08 10:01:52,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {6181#false} ~cond := #in~cond; {6181#false} is VALID [2022-04-08 10:01:52,994 INFO L272 TraceCheckUtils]: 16: Hoare triple {6181#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6181#false} is VALID [2022-04-08 10:01:52,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {6268#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6181#false} is VALID [2022-04-08 10:01:52,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {6272#(< 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; {6268#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:52,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {6276#(< 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; {6272#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:52,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {6280#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {6276#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:52,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {6280#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6280#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:52,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {6287#(< 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; {6280#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:52,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {6291#(< 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; {6287#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:52,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {6295#(< 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; {6291#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:52,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {6299#(< 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; {6295#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:53,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {6303#(< 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; {6299#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:53,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {6180#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6303#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:53,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {6180#true} call #t~ret9 := main(); {6180#true} is VALID [2022-04-08 10:01:53,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6180#true} {6180#true} #50#return; {6180#true} is VALID [2022-04-08 10:01:53,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {6180#true} assume true; {6180#true} is VALID [2022-04-08 10:01:53,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {6180#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); {6180#true} is VALID [2022-04-08 10:01:53,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {6180#true} call ULTIMATE.init(); {6180#true} is VALID [2022-04-08 10:01:53,001 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:01:53,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299673049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:53,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:53,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:01:53,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:53,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1575267941] [2022-04-08 10:01:53,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1575267941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:53,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:53,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:01:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648278072] [2022-04-08 10:01:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:53,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:53,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:53,019 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:01:53,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:01:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:01:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:01:53,020 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:53,575 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-08 10:01:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:01:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2022-04-08 10:01:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2022-04-08 10:01:53,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 41 transitions. [2022-04-08 10:01:53,616 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:01:53,616 INFO L225 Difference]: With dead ends: 41 [2022-04-08 10:01:53,616 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:01:53,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:01:53,617 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:53,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 59 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:01:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-04-08 10:01:53,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:53,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:53,677 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:53,677 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:53,678 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 10:01:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 10:01:53,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:53,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:53,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:01:53,679 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:01:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:53,691 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 10:01:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 10:01:53,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:53,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:53,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:53,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-08 10:01:53,692 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-04-08 10:01:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:53,692 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-08 10:01:53,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:53,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-08 10:01:53,739 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:01:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-08 10:01:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:01:53,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:53,741 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:53,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 10:01:53,947 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:01:53,948 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1195105717, now seen corresponding path program 29 times [2022-04-08 10:01:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:53,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961250998] [2022-04-08 10:01:53,955 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:53,955 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1195105717, now seen corresponding path program 30 times [2022-04-08 10:01:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:53,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915349807] [2022-04-08 10:01:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:54,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {6570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {6556#true} is VALID [2022-04-08 10:01:54,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-08 10:01:54,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-08 10:01:54,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {6556#true} call ULTIMATE.init(); {6570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:54,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {6570#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {6556#true} is VALID [2022-04-08 10:01:54,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-08 10:01:54,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-08 10:01:54,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {6556#true} call #t~ret9 := main(); {6556#true} is VALID [2022-04-08 10:01:54,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {6556#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6561#(= main_~y~0 0)} is VALID [2022-04-08 10:01:54,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {6561#(= 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; {6562#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:54,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {6562#(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; {6563#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:54,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {6563#(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; {6564#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:54,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {6564#(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; {6565#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:54,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {6565#(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; {6566#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:54,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {6566#(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; {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:54,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:54,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6568#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:01:54,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {6568#(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; {6569#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:54,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {6569#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6557#false} is VALID [2022-04-08 10:01:54,088 INFO L272 TraceCheckUtils]: 16: Hoare triple {6557#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6557#false} is VALID [2022-04-08 10:01:54,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#false} ~cond := #in~cond; {6557#false} is VALID [2022-04-08 10:01:54,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#false} assume 0 == ~cond; {6557#false} is VALID [2022-04-08 10:01:54,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {6557#false} assume !false; {6557#false} is VALID [2022-04-08 10:01:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:54,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915349807] [2022-04-08 10:01:54,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915349807] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:54,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228007084] [2022-04-08 10:01:54,089 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:01:54,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:54,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:54,090 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:01:54,127 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:01:54,155 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:01:54,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:54,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:01:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:54,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:54,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {6556#true} call ULTIMATE.init(); {6556#true} is VALID [2022-04-08 10:01:54,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#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); {6556#true} is VALID [2022-04-08 10:01:54,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-08 10:01:54,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-08 10:01:54,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {6556#true} call #t~ret9 := main(); {6556#true} is VALID [2022-04-08 10:01:54,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {6556#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6561#(= main_~y~0 0)} is VALID [2022-04-08 10:01:54,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {6561#(= 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; {6562#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:54,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {6562#(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; {6563#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:54,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {6563#(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; {6564#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:54,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {6564#(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; {6565#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:54,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {6565#(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; {6566#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:54,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {6566#(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; {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:54,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:54,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {6567#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {6568#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:01:54,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {6568#(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; {6616#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:54,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {6616#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6557#false} is VALID [2022-04-08 10:01:54,369 INFO L272 TraceCheckUtils]: 16: Hoare triple {6557#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6557#false} is VALID [2022-04-08 10:01:54,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#false} ~cond := #in~cond; {6557#false} is VALID [2022-04-08 10:01:54,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#false} assume 0 == ~cond; {6557#false} is VALID [2022-04-08 10:01:54,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {6557#false} assume !false; {6557#false} is VALID [2022-04-08 10:01:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:54,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:54,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {6557#false} assume !false; {6557#false} is VALID [2022-04-08 10:01:54,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {6557#false} assume 0 == ~cond; {6557#false} is VALID [2022-04-08 10:01:54,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {6557#false} ~cond := #in~cond; {6557#false} is VALID [2022-04-08 10:01:54,530 INFO L272 TraceCheckUtils]: 16: Hoare triple {6557#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6557#false} is VALID [2022-04-08 10:01:54,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {6644#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6557#false} is VALID [2022-04-08 10:01:54,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {6648#(< 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; {6644#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:54,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {6652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {6648#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:54,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {6652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:54,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {6659#(< 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; {6652#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:54,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {6663#(< 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; {6659#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:54,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {6667#(< 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; {6663#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:54,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {6671#(< 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; {6667#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:54,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {6675#(< 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; {6671#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:54,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {6679#(< 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; {6675#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:01:54,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {6556#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6679#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:01:54,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {6556#true} call #t~ret9 := main(); {6556#true} is VALID [2022-04-08 10:01:54,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6556#true} {6556#true} #50#return; {6556#true} is VALID [2022-04-08 10:01:54,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {6556#true} assume true; {6556#true} is VALID [2022-04-08 10:01:54,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {6556#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); {6556#true} is VALID [2022-04-08 10:01:54,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {6556#true} call ULTIMATE.init(); {6556#true} is VALID [2022-04-08 10:01:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:54,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228007084] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:54,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:54,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:01:54,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:54,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961250998] [2022-04-08 10:01:54,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961250998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:54,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:54,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:01:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339926792] [2022-04-08 10:01:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:54,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:54,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:54,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:54,549 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:01:54,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:01:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:01:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:01:54,550 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:55,112 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 10:01:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:01:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-08 10:01:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-08 10:01:55,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-08 10:01:55,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:55,143 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:01:55,143 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 10:01:55,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:01:55,143 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:55,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 68 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:01:55,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 10:01:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-04-08 10:01:55,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:55,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:55,197 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:55,197 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:55,198 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 10:01:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:01:55,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:55,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:55,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 10:01:55,199 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 10:01:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:55,200 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 10:01:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:01:55,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:55,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:55,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:55,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-08 10:01:55,201 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2022-04-08 10:01:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:55,201 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-08 10:01:55,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:55,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-08 10:01:55,255 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:01:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-08 10:01:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:01:55,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:55,255 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:55,274 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:01:55,463 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:01:55,463 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:55,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1002797804, now seen corresponding path program 13 times [2022-04-08 10:01:55,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:55,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328152109] [2022-04-08 10:01:55,466 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:55,466 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:55,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1002797804, now seen corresponding path program 14 times [2022-04-08 10:01:55,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:55,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249547463] [2022-04-08 10:01:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:55,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:55,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {6956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {6942#true} is VALID [2022-04-08 10:01:55,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-08 10:01:55,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-08 10:01:55,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {6942#true} call ULTIMATE.init(); {6956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:55,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {6956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {6942#true} is VALID [2022-04-08 10:01:55,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-08 10:01:55,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-08 10:01:55,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {6942#true} call #t~ret9 := main(); {6942#true} is VALID [2022-04-08 10:01:55,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {6942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6947#(= main_~y~0 0)} is VALID [2022-04-08 10:01:55,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {6947#(= 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; {6948#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:55,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {6948#(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; {6949#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:55,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {6949#(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; {6950#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:55,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {6950#(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; {6951#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:55,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {6951#(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; {6952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:55,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {6952#(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; {6953#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:55,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {6953#(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; {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:01:55,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:01:55,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {6955#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:01:55,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {6955#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6943#false} is VALID [2022-04-08 10:01:55,612 INFO L272 TraceCheckUtils]: 16: Hoare triple {6943#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6943#false} is VALID [2022-04-08 10:01:55,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {6943#false} ~cond := #in~cond; {6943#false} is VALID [2022-04-08 10:01:55,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {6943#false} assume 0 == ~cond; {6943#false} is VALID [2022-04-08 10:01:55,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#false} assume !false; {6943#false} is VALID [2022-04-08 10:01:55,612 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:01:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:55,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249547463] [2022-04-08 10:01:55,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249547463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:55,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382008780] [2022-04-08 10:01:55,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:55,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:55,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:55,628 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:01:55,629 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:01:55,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:55,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:55,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:01:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:55,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:55,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {6942#true} call ULTIMATE.init(); {6942#true} is VALID [2022-04-08 10:01:55,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#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); {6942#true} is VALID [2022-04-08 10:01:55,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-08 10:01:55,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-08 10:01:55,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {6942#true} call #t~ret9 := main(); {6942#true} is VALID [2022-04-08 10:01:55,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {6942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6947#(= main_~y~0 0)} is VALID [2022-04-08 10:01:55,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {6947#(= 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; {6948#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:55,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {6948#(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; {6949#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:55,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {6949#(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; {6950#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:55,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {6950#(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; {6951#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:55,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {6951#(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; {6952#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:55,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {6952#(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; {6953#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:01:55,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {6953#(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; {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:01:55,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:01:55,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {6954#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:01:55,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {7002#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {6943#false} is VALID [2022-04-08 10:01:55,822 INFO L272 TraceCheckUtils]: 16: Hoare triple {6943#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6943#false} is VALID [2022-04-08 10:01:55,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {6943#false} ~cond := #in~cond; {6943#false} is VALID [2022-04-08 10:01:55,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {6943#false} assume 0 == ~cond; {6943#false} is VALID [2022-04-08 10:01:55,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#false} assume !false; {6943#false} is VALID [2022-04-08 10:01:55,822 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:01:55,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:55,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {6943#false} assume !false; {6943#false} is VALID [2022-04-08 10:01:55,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {6943#false} assume 0 == ~cond; {6943#false} is VALID [2022-04-08 10:01:55,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {6943#false} ~cond := #in~cond; {6943#false} is VALID [2022-04-08 10:01:55,950 INFO L272 TraceCheckUtils]: 16: Hoare triple {6943#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6943#false} is VALID [2022-04-08 10:01:55,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {7030#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6943#false} is VALID [2022-04-08 10:01:55,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {7034#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7030#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:55,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {7034#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7034#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:55,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {7041#(< 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; {7034#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:55,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {7045#(< 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; {7041#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:55,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {7049#(< 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; {7045#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:55,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {7053#(< 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; {7049#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:01:55,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {7057#(< 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; {7053#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:01:55,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {7061#(< 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; {7057#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:01:55,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {7065#(< 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; {7061#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:01:55,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {6942#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7065#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:01:55,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {6942#true} call #t~ret9 := main(); {6942#true} is VALID [2022-04-08 10:01:55,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6942#true} {6942#true} #50#return; {6942#true} is VALID [2022-04-08 10:01:55,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {6942#true} assume true; {6942#true} is VALID [2022-04-08 10:01:55,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {6942#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); {6942#true} is VALID [2022-04-08 10:01:55,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {6942#true} call ULTIMATE.init(); {6942#true} is VALID [2022-04-08 10:01:55,955 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:01:55,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382008780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:55,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:55,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:01:55,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:55,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328152109] [2022-04-08 10:01:55,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328152109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:55,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:55,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:01:55,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547967800] [2022-04-08 10:01:55,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:55,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:55,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:55,966 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:01:55,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:01:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:01:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:01:55,967 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:56,551 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-08 10:01:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:01:56,551 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-08 10:01:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-08 10:01:56,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-08 10:01:56,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:56,589 INFO L225 Difference]: With dead ends: 49 [2022-04-08 10:01:56,589 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 10:01:56,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:01:56,590 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:56,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 71 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:01:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 10:01:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-04-08 10:01:56,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:56,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:56,661 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:56,661 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:56,661 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 10:01:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-08 10:01:56,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:56,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:56,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-08 10:01:56,662 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-08 10:01:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:56,662 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 10:01:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-08 10:01:56,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:56,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:56,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:56,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-08 10:01:56,663 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2022-04-08 10:01:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:56,663 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-08 10:01:56,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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:01:56,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-08 10:01:56,709 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:01:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 10:01:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:01:56,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:56,709 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:56,725 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:01:56,911 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:01:56,911 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1612182871, now seen corresponding path program 31 times [2022-04-08 10:01:56,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:56,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63710449] [2022-04-08 10:01:56,914 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:56,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1612182871, now seen corresponding path program 32 times [2022-04-08 10:01:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:56,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598154321] [2022-04-08 10:01:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:57,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {7363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {7350#true} is VALID [2022-04-08 10:01:57,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-08 10:01:57,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-08 10:01:57,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {7350#true} call ULTIMATE.init(); {7363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:57,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {7363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {7350#true} is VALID [2022-04-08 10:01:57,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-08 10:01:57,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-08 10:01:57,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {7350#true} call #t~ret9 := main(); {7350#true} is VALID [2022-04-08 10:01:57,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {7350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:57,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:57,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:57,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:57,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:01:57,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:01:57,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:01:57,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ 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; {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:57,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:57,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:57,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7360#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:57,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {7360#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {7360#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:01:57,102 INFO L272 TraceCheckUtils]: 17: Hoare triple {7360#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:01:57,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {7361#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7362#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:01:57,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {7362#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7351#false} is VALID [2022-04-08 10:01:57,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {7351#false} assume !false; {7351#false} is VALID [2022-04-08 10:01:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598154321] [2022-04-08 10:01:57,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598154321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129960932] [2022-04-08 10:01:57,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:01:57,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:57,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:57,104 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:01:57,105 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:01:57,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:01:57,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:57,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:01:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:57,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:57,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {7350#true} call ULTIMATE.init(); {7350#true} is VALID [2022-04-08 10:01:57,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {7350#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); {7350#true} is VALID [2022-04-08 10:01:57,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-08 10:01:57,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-08 10:01:57,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {7350#true} call #t~ret9 := main(); {7350#true} is VALID [2022-04-08 10:01:57,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {7350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:57,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:57,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:57,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:57,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:01:57,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:01:57,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:01:57,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {7359#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ 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; {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:01:57,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {7358#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:01:57,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {7357#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:01:57,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {7356#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:57,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:01:57,353 INFO L272 TraceCheckUtils]: 17: Hoare triple {7355#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:57,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {7418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:57,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {7422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7351#false} is VALID [2022-04-08 10:01:57,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {7351#false} assume !false; {7351#false} is VALID [2022-04-08 10:01:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:57,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:57,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {7351#false} assume !false; {7351#false} is VALID [2022-04-08 10:01:57,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {7422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7351#false} is VALID [2022-04-08 10:01:57,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {7418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:01:57,526 INFO L272 TraceCheckUtils]: 17: Hoare triple {7438#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:01:57,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {7438#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7438#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:57,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {7445#(= (mod main_~n~0 4294967296) (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; {7438#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:57,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {7449#(= (mod main_~n~0 4294967296) (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; {7445#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:57,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {7453#(= (mod (+ main_~x~0 3) 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; {7449#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:01:57,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {7457#(= (mod main_~n~0 4294967296) (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; {7453#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:01:57,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {7457#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} ~z~0 := ~y~0; {7457#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:01:57,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {7457#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} assume !(~x~0 % 4294967296 > 0); {7457#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:01:57,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {7453#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~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; {7457#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:01:57,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {7449#(= (mod main_~n~0 4294967296) (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; {7453#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:01:57,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {7445#(= (mod main_~n~0 4294967296) (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; {7449#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:01:57,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {7438#(= (mod main_~n~0 4294967296) (mod 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; {7445#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:01:57,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {7350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7438#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:01:57,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {7350#true} call #t~ret9 := main(); {7350#true} is VALID [2022-04-08 10:01:57,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7350#true} {7350#true} #50#return; {7350#true} is VALID [2022-04-08 10:01:57,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {7350#true} assume true; {7350#true} is VALID [2022-04-08 10:01:57,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {7350#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); {7350#true} is VALID [2022-04-08 10:01:57,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {7350#true} call ULTIMATE.init(); {7350#true} is VALID [2022-04-08 10:01:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:01:57,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129960932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:57,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:57,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2022-04-08 10:01:57,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:57,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63710449] [2022-04-08 10:01:57,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63710449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:57,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:57,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:01:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969260722] [2022-04-08 10:01:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:57,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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:01:57,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:57,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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:01:57,555 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:01:57,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:01:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:57,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:01:57,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:01:57,555 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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:01:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:57,978 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-08 10:01:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:01:57,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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:01:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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:01:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 10:01:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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:01:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 10:01:57,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-08 10:01:58,004 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:01:58,005 INFO L225 Difference]: With dead ends: 39 [2022-04-08 10:01:58,005 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:01:58,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:01:58,005 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:58,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 48 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:01:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-08 10:01:58,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:58,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:58,077 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:58,077 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:58,079 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 10:01:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-08 10:01:58,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:58,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:58,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-08 10:01:58,079 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-08 10:01:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:58,081 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 10:01:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-08 10:01:58,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:58,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:58,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:58,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-08 10:01:58,081 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-08 10:01:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:58,081 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-08 10:01:58,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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:01:58,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-08 10:01:58,125 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:01:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 10:01:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:01:58,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:58,125 INFO L499 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:58,142 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:01:58,331 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:01:58,331 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:58,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1715417834, now seen corresponding path program 33 times [2022-04-08 10:01:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:58,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160089341] [2022-04-08 10:01:58,334 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:58,334 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1715417834, now seen corresponding path program 34 times [2022-04-08 10:01:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:58,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803878165] [2022-04-08 10:01:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:58,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:58,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:01:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:58,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {7733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {7718#true} is VALID [2022-04-08 10:01:58,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-08 10:01:58,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-08 10:01:58,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {7718#true} call ULTIMATE.init(); {7733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:01:58,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {7733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {7718#true} is VALID [2022-04-08 10:01:58,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-08 10:01:58,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-08 10:01:58,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {7718#true} call #t~ret9 := main(); {7718#true} is VALID [2022-04-08 10:01:58,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {7718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7723#(= main_~y~0 0)} is VALID [2022-04-08 10:01:58,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#(= 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; {7724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:58,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {7724#(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; {7725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:58,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {7725#(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; {7726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:58,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {7726#(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; {7727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:58,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {7727#(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; {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:58,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:58,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {7729#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:58,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {7729#(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; {7730#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:58,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {7730#(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; {7731#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:58,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {7731#(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; {7732#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:58,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {7732#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7719#false} is VALID [2022-04-08 10:01:58,495 INFO L272 TraceCheckUtils]: 17: Hoare triple {7719#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7719#false} is VALID [2022-04-08 10:01:58,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {7719#false} ~cond := #in~cond; {7719#false} is VALID [2022-04-08 10:01:58,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#false} assume 0 == ~cond; {7719#false} is VALID [2022-04-08 10:01:58,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#false} assume !false; {7719#false} is VALID [2022-04-08 10:01:58,496 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:01:58,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:01:58,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803878165] [2022-04-08 10:01:58,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803878165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:01:58,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709809143] [2022-04-08 10:01:58,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:01:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:01:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:01:58,497 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:01:58,498 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:01:58,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:01:58,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:01:58,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:01:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:01:58,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:01:58,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {7718#true} call ULTIMATE.init(); {7718#true} is VALID [2022-04-08 10:01:58,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7718#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); {7718#true} is VALID [2022-04-08 10:01:58,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-08 10:01:58,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-08 10:01:58,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {7718#true} call #t~ret9 := main(); {7718#true} is VALID [2022-04-08 10:01:58,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {7718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7723#(= main_~y~0 0)} is VALID [2022-04-08 10:01:58,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {7723#(= 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; {7724#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:01:58,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {7724#(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; {7725#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:01:58,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {7725#(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; {7726#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:01:58,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {7726#(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; {7727#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:01:58,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {7727#(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; {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:58,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:01:58,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {7728#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {7729#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:01:58,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {7729#(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; {7730#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:01:58,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {7730#(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; {7731#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:01:58,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {7731#(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; {7782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:01:58,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {7782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7719#false} is VALID [2022-04-08 10:01:58,719 INFO L272 TraceCheckUtils]: 17: Hoare triple {7719#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7719#false} is VALID [2022-04-08 10:01:58,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {7719#false} ~cond := #in~cond; {7719#false} is VALID [2022-04-08 10:01:58,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#false} assume 0 == ~cond; {7719#false} is VALID [2022-04-08 10:01:58,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#false} assume !false; {7719#false} is VALID [2022-04-08 10:01:58,719 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:01:58,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:01:58,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {7719#false} assume !false; {7719#false} is VALID [2022-04-08 10:01:58,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {7719#false} assume 0 == ~cond; {7719#false} is VALID [2022-04-08 10:01:58,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {7719#false} ~cond := #in~cond; {7719#false} is VALID [2022-04-08 10:01:58,922 INFO L272 TraceCheckUtils]: 17: Hoare triple {7719#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7719#false} is VALID [2022-04-08 10:01:58,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {7810#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7719#false} is VALID [2022-04-08 10:01:58,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {7814#(< 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; {7810#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:01:58,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {7818#(< 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; {7814#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:58,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {7822#(< 0 (mod (+ main_~z~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; {7818#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:58,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {7826#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {7822#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:58,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {7826#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {7826#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:58,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {7833#(< 0 (mod (+ main_~y~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; {7826#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:01:58,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {7837#(< 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; {7833#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:01:58,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {7841#(< 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; {7837#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:01:58,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {7845#(< 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; {7841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:01:58,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {7849#(< 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; {7845#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:01:58,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {7718#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7849#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:01:58,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {7718#true} call #t~ret9 := main(); {7718#true} is VALID [2022-04-08 10:01:58,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7718#true} {7718#true} #50#return; {7718#true} is VALID [2022-04-08 10:01:58,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {7718#true} assume true; {7718#true} is VALID [2022-04-08 10:01:58,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {7718#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); {7718#true} is VALID [2022-04-08 10:01:58,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {7718#true} call ULTIMATE.init(); {7718#true} is VALID [2022-04-08 10:01:58,929 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:01:58,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709809143] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:01:58,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:01:58,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:01:58,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:01:58,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1160089341] [2022-04-08 10:01:58,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1160089341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:01:58,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:01:58,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:01:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331606432] [2022-04-08 10:01:58,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:01:58,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:01:58,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:01:58,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:01:58,944 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:01:58,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:01:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:01:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:01:58,945 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:01:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:59,582 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-08 10:01:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:01:59,582 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:01:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:01:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:01:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-08 10:01:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:01:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 43 transitions. [2022-04-08 10:01:59,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 43 transitions. [2022-04-08 10:01:59,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:01:59,615 INFO L225 Difference]: With dead ends: 46 [2022-04-08 10:01:59,615 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 10:01:59,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1063, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:01:59,616 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:01:59,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 54 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:01:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 10:01:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-04-08 10:01:59,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:01:59,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:59,706 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:59,706 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:59,706 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 10:01:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 10:01:59,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:59,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:59,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 10:01:59,707 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-08 10:01:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:01:59,707 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 10:01:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-08 10:01:59,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:01:59,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:01:59,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:01:59,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:01:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:01:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-08 10:01:59,708 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-08 10:01:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:01:59,708 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-08 10:01:59,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:01:59,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-08 10:01:59,762 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:01:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 10:01:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:01:59,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:01:59,763 INFO L499 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:01:59,779 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:01:59,963 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:01:59,963 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:01:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:01:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1640923511, now seen corresponding path program 35 times [2022-04-08 10:01:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:01:59,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893064410] [2022-04-08 10:01:59,967 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:01:59,967 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:01:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1640923511, now seen corresponding path program 36 times [2022-04-08 10:01:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:01:59,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825515223] [2022-04-08 10:01:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:01:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:01:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:00,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:00,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {8147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {8132#true} is VALID [2022-04-08 10:02:00,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-08 10:02:00,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-08 10:02:00,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {8132#true} call ULTIMATE.init(); {8147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:00,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {8147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {8132#true} is VALID [2022-04-08 10:02:00,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-08 10:02:00,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-08 10:02:00,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#true} call #t~ret9 := main(); {8132#true} is VALID [2022-04-08 10:02:00,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {8132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8137#(= main_~y~0 0)} is VALID [2022-04-08 10:02:00,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {8137#(= 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; {8138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:00,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {8138#(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; {8139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:00,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {8139#(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; {8140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:00,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {8140#(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; {8141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:00,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {8141#(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; {8142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:00,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {8142#(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; {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:00,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:00,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {8144#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:00,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {8144#(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; {8145#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:00,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {8145#(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; {8146#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:00,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {8146#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {8133#false} is VALID [2022-04-08 10:02:00,121 INFO L272 TraceCheckUtils]: 17: Hoare triple {8133#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8133#false} is VALID [2022-04-08 10:02:00,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#false} ~cond := #in~cond; {8133#false} is VALID [2022-04-08 10:02:00,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {8133#false} assume 0 == ~cond; {8133#false} is VALID [2022-04-08 10:02:00,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {8133#false} assume !false; {8133#false} is VALID [2022-04-08 10:02:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:00,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825515223] [2022-04-08 10:02:00,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825515223] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:00,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26705151] [2022-04-08 10:02:00,122 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:00,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:00,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:00,123 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:02:00,146 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:02:00,190 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:02:00,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:00,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:02:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:00,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:00,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {8132#true} call ULTIMATE.init(); {8132#true} is VALID [2022-04-08 10:02:00,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {8132#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); {8132#true} is VALID [2022-04-08 10:02:00,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-08 10:02:00,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-08 10:02:00,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#true} call #t~ret9 := main(); {8132#true} is VALID [2022-04-08 10:02:00,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {8132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8137#(= main_~y~0 0)} is VALID [2022-04-08 10:02:00,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {8137#(= 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; {8138#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:00,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {8138#(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; {8139#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:00,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {8139#(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; {8140#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:00,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {8140#(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; {8141#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:00,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {8141#(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; {8142#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:00,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {8142#(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; {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:00,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:00,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {8143#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {8144#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:00,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {8144#(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; {8145#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:00,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {8145#(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; {8196#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:00,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {8196#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {8133#false} is VALID [2022-04-08 10:02:00,396 INFO L272 TraceCheckUtils]: 17: Hoare triple {8133#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8133#false} is VALID [2022-04-08 10:02:00,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#false} ~cond := #in~cond; {8133#false} is VALID [2022-04-08 10:02:00,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {8133#false} assume 0 == ~cond; {8133#false} is VALID [2022-04-08 10:02:00,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {8133#false} assume !false; {8133#false} is VALID [2022-04-08 10:02:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:00,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:00,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {8133#false} assume !false; {8133#false} is VALID [2022-04-08 10:02:00,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {8133#false} assume 0 == ~cond; {8133#false} is VALID [2022-04-08 10:02:00,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {8133#false} ~cond := #in~cond; {8133#false} is VALID [2022-04-08 10:02:00,600 INFO L272 TraceCheckUtils]: 17: Hoare triple {8133#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8133#false} is VALID [2022-04-08 10:02:00,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {8224#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8133#false} is VALID [2022-04-08 10:02:00,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {8228#(< 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; {8224#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:00,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {8232#(< 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; {8228#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:00,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {8236#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {8232#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:00,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {8236#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8236#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:00,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {8243#(< 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; {8236#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:00,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {8247#(< 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; {8243#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:00,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {8251#(< 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; {8247#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:00,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {8255#(< 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; {8251#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:00,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {8259#(< 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; {8255#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:00,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {8263#(< 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; {8259#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:00,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {8132#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8263#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:00,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#true} call #t~ret9 := main(); {8132#true} is VALID [2022-04-08 10:02:00,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#true} {8132#true} #50#return; {8132#true} is VALID [2022-04-08 10:02:00,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#true} assume true; {8132#true} is VALID [2022-04-08 10:02:00,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {8132#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); {8132#true} is VALID [2022-04-08 10:02:00,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {8132#true} call ULTIMATE.init(); {8132#true} is VALID [2022-04-08 10:02:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:00,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26705151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:00,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:00,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:02:00,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:00,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893064410] [2022-04-08 10:02:00,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893064410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:00,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:00,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:02:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072232453] [2022-04-08 10:02:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:00,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:00,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:00,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:00,624 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:02:00,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:02:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:02:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:02:00,625 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:01,446 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-08 10:02:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:02:01,446 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2022-04-08 10:02:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 48 transitions. [2022-04-08 10:02:01,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 48 transitions. [2022-04-08 10:02:01,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:01,475 INFO L225 Difference]: With dead ends: 50 [2022-04-08 10:02:01,475 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 10:02:01,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:02:01,476 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:01,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 72 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 10:02:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-04-08 10:02:01,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:01,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:01,588 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:01,588 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:01,589 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-08 10:02:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-08 10:02:01,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:01,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:01,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-08 10:02:01,589 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-08 10:02:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:01,590 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-08 10:02:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-08 10:02:01,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:01,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:01,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:01,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-08 10:02:01,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-08 10:02:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:01,590 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-08 10:02:01,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:01,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-08 10:02:01,648 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:02:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 10:02:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:02:01,649 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:01,649 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:01,667 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:02:01,849 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:02:01,849 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1056455926, now seen corresponding path program 37 times [2022-04-08 10:02:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:01,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759978634] [2022-04-08 10:02:01,852 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:01,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1056455926, now seen corresponding path program 38 times [2022-04-08 10:02:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911971462] [2022-04-08 10:02:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:01,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:02,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {8577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {8562#true} is VALID [2022-04-08 10:02:02,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-08 10:02:02,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-08 10:02:02,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {8562#true} call ULTIMATE.init(); {8577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:02,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {8577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {8562#true} is VALID [2022-04-08 10:02:02,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-08 10:02:02,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-08 10:02:02,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {8562#true} call #t~ret9 := main(); {8562#true} is VALID [2022-04-08 10:02:02,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {8562#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8567#(= main_~y~0 0)} is VALID [2022-04-08 10:02:02,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {8567#(= 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; {8568#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:02,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {8568#(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; {8569#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:02,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {8569#(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; {8570#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:02,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {8570#(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; {8571#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:02,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {8571#(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; {8572#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:02,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {8572#(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; {8573#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:02,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {8573#(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; {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:02,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:02,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {8575#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:02,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {8575#(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; {8576#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:02,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {8576#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8563#false} is VALID [2022-04-08 10:02:02,017 INFO L272 TraceCheckUtils]: 17: Hoare triple {8563#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8563#false} is VALID [2022-04-08 10:02:02,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {8563#false} ~cond := #in~cond; {8563#false} is VALID [2022-04-08 10:02:02,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {8563#false} assume 0 == ~cond; {8563#false} is VALID [2022-04-08 10:02:02,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {8563#false} assume !false; {8563#false} is VALID [2022-04-08 10:02:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:02,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:02,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911971462] [2022-04-08 10:02:02,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911971462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:02,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091442966] [2022-04-08 10:02:02,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:02,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:02,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:02,018 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:02:02,020 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:02:02,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:02,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:02,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:02:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:02,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:02,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {8562#true} call ULTIMATE.init(); {8562#true} is VALID [2022-04-08 10:02:02,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {8562#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); {8562#true} is VALID [2022-04-08 10:02:02,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-08 10:02:02,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-08 10:02:02,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {8562#true} call #t~ret9 := main(); {8562#true} is VALID [2022-04-08 10:02:02,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {8562#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8567#(= main_~y~0 0)} is VALID [2022-04-08 10:02:02,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {8567#(= 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; {8568#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:02,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {8568#(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; {8569#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:02,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {8569#(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; {8570#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:02,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {8570#(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; {8571#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:02,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {8571#(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; {8572#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:02,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {8572#(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; {8573#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:02,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {8573#(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; {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:02,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:02,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {8574#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {8575#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:02,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {8575#(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; {8626#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:02,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {8626#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8563#false} is VALID [2022-04-08 10:02:02,252 INFO L272 TraceCheckUtils]: 17: Hoare triple {8563#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8563#false} is VALID [2022-04-08 10:02:02,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {8563#false} ~cond := #in~cond; {8563#false} is VALID [2022-04-08 10:02:02,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {8563#false} assume 0 == ~cond; {8563#false} is VALID [2022-04-08 10:02:02,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {8563#false} assume !false; {8563#false} is VALID [2022-04-08 10:02:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:02,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:02,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {8563#false} assume !false; {8563#false} is VALID [2022-04-08 10:02:02,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {8563#false} assume 0 == ~cond; {8563#false} is VALID [2022-04-08 10:02:02,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {8563#false} ~cond := #in~cond; {8563#false} is VALID [2022-04-08 10:02:02,459 INFO L272 TraceCheckUtils]: 17: Hoare triple {8563#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8563#false} is VALID [2022-04-08 10:02:02,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {8654#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8563#false} is VALID [2022-04-08 10:02:02,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {8658#(< 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; {8654#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:02,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {8662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {8658#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:02,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {8662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {8662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:02,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {8669#(< 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; {8662#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:02,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {8673#(< 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; {8669#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:02,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {8677#(< 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; {8673#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:02,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {8681#(< 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; {8677#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:02,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {8685#(< 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; {8681#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:02,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {8689#(< 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; {8685#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:02,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {8693#(< 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; {8689#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:02,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {8562#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8693#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:02,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {8562#true} call #t~ret9 := main(); {8562#true} is VALID [2022-04-08 10:02:02,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8562#true} {8562#true} #50#return; {8562#true} is VALID [2022-04-08 10:02:02,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {8562#true} assume true; {8562#true} is VALID [2022-04-08 10:02:02,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {8562#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); {8562#true} is VALID [2022-04-08 10:02:02,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {8562#true} call ULTIMATE.init(); {8562#true} is VALID [2022-04-08 10:02:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:02,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091442966] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:02,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:02,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:02:02,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:02,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759978634] [2022-04-08 10:02:02,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759978634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:02,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:02,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:02:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605272172] [2022-04-08 10:02:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:02,467 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:02,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:02,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:02,481 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:02:02,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:02:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:02:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:02:02,481 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:03,332 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-08 10:02:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:02:03,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-08 10:02:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-08 10:02:03,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-08 10:02:03,371 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:02:03,372 INFO L225 Difference]: With dead ends: 53 [2022-04-08 10:02:03,372 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 10:02:03,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 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:02:03,373 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:03,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 77 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 10:02:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2022-04-08 10:02:03,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:03,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:03,464 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:03,464 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:03,465 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-08 10:02:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:02:03,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:03,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:03,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 10:02:03,467 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-08 10:02:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:03,467 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-08 10:02:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:02:03,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:03,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:03,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:03,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-08 10:02:03,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2022-04-08 10:02:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:03,469 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-08 10:02:03,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:03,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-08 10:02:03,535 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:02:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 10:02:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:02:03,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:03,536 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:03,572 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:02:03,736 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:02:03,737 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:03,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1040607849, now seen corresponding path program 15 times [2022-04-08 10:02:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:03,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371081845] [2022-04-08 10:02:03,739 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:03,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1040607849, now seen corresponding path program 16 times [2022-04-08 10:02:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:03,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012710950] [2022-04-08 10:02:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:03,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {9015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {9000#true} is VALID [2022-04-08 10:02:03,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-08 10:02:03,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-08 10:02:03,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {9000#true} call ULTIMATE.init(); {9015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:03,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {9015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {9000#true} is VALID [2022-04-08 10:02:03,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-08 10:02:03,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-08 10:02:03,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {9000#true} call #t~ret9 := main(); {9000#true} is VALID [2022-04-08 10:02:03,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {9000#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9005#(= main_~y~0 0)} is VALID [2022-04-08 10:02:03,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {9005#(= 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; {9006#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:03,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {9006#(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; {9007#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:03,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {9007#(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; {9008#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:03,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {9008#(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; {9009#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:03,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {9009#(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; {9010#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:03,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {9010#(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; {9011#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:03,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {9011#(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; {9012#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:03,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {9012#(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; {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:03,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:03,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9014#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:03,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {9014#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9001#false} is VALID [2022-04-08 10:02:03,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {9001#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9001#false} is VALID [2022-04-08 10:02:03,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {9001#false} ~cond := #in~cond; {9001#false} is VALID [2022-04-08 10:02:03,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {9001#false} assume 0 == ~cond; {9001#false} is VALID [2022-04-08 10:02:03,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {9001#false} assume !false; {9001#false} is VALID [2022-04-08 10:02:03,900 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:02:03,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:03,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012710950] [2022-04-08 10:02:03,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012710950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:03,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476681872] [2022-04-08 10:02:03,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:03,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:03,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:03,901 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:02:03,902 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:02:03,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:03,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:03,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:02:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:03,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:04,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {9000#true} call ULTIMATE.init(); {9000#true} is VALID [2022-04-08 10:02:04,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {9000#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); {9000#true} is VALID [2022-04-08 10:02:04,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-08 10:02:04,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-08 10:02:04,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {9000#true} call #t~ret9 := main(); {9000#true} is VALID [2022-04-08 10:02:04,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {9000#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9005#(= main_~y~0 0)} is VALID [2022-04-08 10:02:04,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {9005#(= 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; {9006#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:04,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {9006#(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; {9007#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:04,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {9007#(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; {9008#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:04,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {9008#(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; {9009#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:04,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {9009#(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; {9010#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:04,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {9010#(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; {9011#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:04,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {9011#(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; {9012#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:04,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {9012#(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; {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:04,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:04,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {9013#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9064#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:04,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {9064#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {9001#false} is VALID [2022-04-08 10:02:04,151 INFO L272 TraceCheckUtils]: 17: Hoare triple {9001#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9001#false} is VALID [2022-04-08 10:02:04,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {9001#false} ~cond := #in~cond; {9001#false} is VALID [2022-04-08 10:02:04,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {9001#false} assume 0 == ~cond; {9001#false} is VALID [2022-04-08 10:02:04,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {9001#false} assume !false; {9001#false} is VALID [2022-04-08 10:02:04,151 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:02:04,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:04,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {9001#false} assume !false; {9001#false} is VALID [2022-04-08 10:02:04,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {9001#false} assume 0 == ~cond; {9001#false} is VALID [2022-04-08 10:02:04,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {9001#false} ~cond := #in~cond; {9001#false} is VALID [2022-04-08 10:02:04,367 INFO L272 TraceCheckUtils]: 17: Hoare triple {9001#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9001#false} is VALID [2022-04-08 10:02:04,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {9092#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9001#false} is VALID [2022-04-08 10:02:04,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {9096#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {9092#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:04,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {9096#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9096#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:04,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {9103#(< 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; {9096#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:04,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {9107#(< 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; {9103#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:04,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {9111#(< 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; {9107#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:04,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {9115#(< 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; {9111#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:04,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {9119#(< 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; {9115#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:04,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {9123#(< 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; {9119#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:04,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {9127#(< 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; {9123#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:04,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {9131#(< 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; {9127#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:04,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {9000#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9131#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:02:04,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {9000#true} call #t~ret9 := main(); {9000#true} is VALID [2022-04-08 10:02:04,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9000#true} {9000#true} #50#return; {9000#true} is VALID [2022-04-08 10:02:04,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {9000#true} assume true; {9000#true} is VALID [2022-04-08 10:02:04,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {9000#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); {9000#true} is VALID [2022-04-08 10:02:04,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {9000#true} call ULTIMATE.init(); {9000#true} is VALID [2022-04-08 10:02:04,374 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:02:04,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476681872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:04,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:04,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:02:04,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:04,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371081845] [2022-04-08 10:02:04,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371081845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:04,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:04,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:02:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710147575] [2022-04-08 10:02:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:04,375 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:04,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:04,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:04,388 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:02:04,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:02:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:02:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:02:04,389 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:05,322 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2022-04-08 10:02:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:02:05,323 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-08 10:02:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-08 10:02:05,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 55 transitions. [2022-04-08 10:02:05,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:05,366 INFO L225 Difference]: With dead ends: 58 [2022-04-08 10:02:05,366 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 10:02:05,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 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:02:05,367 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:05,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:02:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 10:02:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-04-08 10:02:05,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:05,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:05,469 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:05,470 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:05,470 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-08 10:02:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-08 10:02:05,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:05,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:05,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 10:02:05,471 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 10:02:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:05,471 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-08 10:02:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-08 10:02:05,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:05,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:05,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:05,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-08 10:02:05,472 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 21 [2022-04-08 10:02:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:05,472 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-08 10:02:05,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 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:02:05,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 39 transitions. [2022-04-08 10:02:05,536 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:02:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-08 10:02:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:02:05,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:05,537 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:05,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 10:02:05,737 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:02:05,737 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:05,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1527443477, now seen corresponding path program 39 times [2022-04-08 10:02:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:05,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120139395] [2022-04-08 10:02:05,739 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:05,739 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1527443477, now seen corresponding path program 40 times [2022-04-08 10:02:05,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:05,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556584955] [2022-04-08 10:02:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:05,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:05,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {9475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {9460#true} is VALID [2022-04-08 10:02:05,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-08 10:02:05,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-08 10:02:05,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:05,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {9475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {9460#true} is VALID [2022-04-08 10:02:05,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-08 10:02:05,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-08 10:02:05,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret9 := main(); {9460#true} is VALID [2022-04-08 10:02:05,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {9460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9465#(= main_~y~0 0)} is VALID [2022-04-08 10:02:05,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {9465#(= 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; {9466#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:05,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {9466#(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; {9467#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:05,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {9467#(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; {9468#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:05,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {9468#(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; {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:05,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:05,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {9470#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:05,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {9470#(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; {9471#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:05,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(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; {9472#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:05,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(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; {9473#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:05,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {9473#(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; {9474#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:02:05,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {9474#(and (<= main_~z~0 0) (<= 0 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; {9461#false} is VALID [2022-04-08 10:02:05,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#false} assume !(~z~0 % 4294967296 > 0); {9461#false} is VALID [2022-04-08 10:02:05,878 INFO L272 TraceCheckUtils]: 18: Hoare triple {9461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9461#false} is VALID [2022-04-08 10:02:05,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {9461#false} ~cond := #in~cond; {9461#false} is VALID [2022-04-08 10:02:05,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {9461#false} assume 0 == ~cond; {9461#false} is VALID [2022-04-08 10:02:05,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2022-04-08 10:02:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:05,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:05,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556584955] [2022-04-08 10:02:05,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556584955] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:05,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168819509] [2022-04-08 10:02:05,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:05,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:05,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:05,879 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:02:05,880 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:02:05,919 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:05,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:05,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:02:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:05,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:06,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9460#true} is VALID [2022-04-08 10:02:06,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {9460#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); {9460#true} is VALID [2022-04-08 10:02:06,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-08 10:02:06,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-08 10:02:06,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret9 := main(); {9460#true} is VALID [2022-04-08 10:02:06,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {9460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9465#(= main_~y~0 0)} is VALID [2022-04-08 10:02:06,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {9465#(= 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; {9466#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:06,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {9466#(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; {9467#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:06,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {9467#(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; {9468#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:06,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {9468#(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; {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:06,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:06,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {9469#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {9470#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:06,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {9470#(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; {9471#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:06,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(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; {9472#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:06,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(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; {9473#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:06,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {9473#(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; {9474#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:02:06,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {9474#(and (<= main_~z~0 0) (<= 0 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; {9461#false} is VALID [2022-04-08 10:02:06,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#false} assume !(~z~0 % 4294967296 > 0); {9461#false} is VALID [2022-04-08 10:02:06,133 INFO L272 TraceCheckUtils]: 18: Hoare triple {9461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9461#false} is VALID [2022-04-08 10:02:06,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {9461#false} ~cond := #in~cond; {9461#false} is VALID [2022-04-08 10:02:06,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {9461#false} assume 0 == ~cond; {9461#false} is VALID [2022-04-08 10:02:06,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2022-04-08 10:02:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:06,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:06,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {9461#false} assume !false; {9461#false} is VALID [2022-04-08 10:02:06,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {9461#false} assume 0 == ~cond; {9461#false} is VALID [2022-04-08 10:02:06,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {9461#false} ~cond := #in~cond; {9461#false} is VALID [2022-04-08 10:02:06,342 INFO L272 TraceCheckUtils]: 18: Hoare triple {9461#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9461#false} is VALID [2022-04-08 10:02:06,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#false} assume !(~z~0 % 4294967296 > 0); {9461#false} is VALID [2022-04-08 10:02:06,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {9557#(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; {9461#false} is VALID [2022-04-08 10:02:06,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {9561#(not (< 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; {9557#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:02:06,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {9565#(not (< 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; {9561#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:02:06,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {9569#(not (< 0 (mod (+ main_~z~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; {9565#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:02:06,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {9573#(not (< 0 (mod (+ 4294967292 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; {9569#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:02:06,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {9577#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} ~z~0 := ~y~0; {9573#(not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:02:06,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {9577#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9577#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:02:06,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {9584#(not (< 0 (mod (+ main_~y~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; {9577#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:02:06,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {9588#(not (< 0 (mod (+ main_~y~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; {9584#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:02:06,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {9592#(not (< 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; {9588#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:02:06,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {9596#(not (< 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; {9592#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:02:06,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {9460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9596#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:02:06,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {9460#true} call #t~ret9 := main(); {9460#true} is VALID [2022-04-08 10:02:06,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9460#true} {9460#true} #50#return; {9460#true} is VALID [2022-04-08 10:02:06,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {9460#true} assume true; {9460#true} is VALID [2022-04-08 10:02:06,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {9460#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); {9460#true} is VALID [2022-04-08 10:02:06,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {9460#true} call ULTIMATE.init(); {9460#true} is VALID [2022-04-08 10:02:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:06,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168819509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:06,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:06,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-08 10:02:06,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:06,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120139395] [2022-04-08 10:02:06,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120139395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:06,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:06,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:02:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870696283] [2022-04-08 10:02:06,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:06,350 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:02:06,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:06,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:02:06,366 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:02:06,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:02:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:02:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:02:06,366 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:02:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:06,959 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 10:02:06,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:02:06,959 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:02:06,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:02:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 33 transitions. [2022-04-08 10:02:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:02:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 33 transitions. [2022-04-08 10:02:06,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 33 transitions. [2022-04-08 10:02:06,984 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:02:06,984 INFO L225 Difference]: With dead ends: 43 [2022-04-08 10:02:06,984 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 10:02:06,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:02:06,985 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:06,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:02:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 10:02:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 10:02:07,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:07,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:07,069 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:07,069 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:07,070 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-08 10:02:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 10:02:07,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:07,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:07,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 10:02:07,070 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-08 10:02:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:07,070 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-08 10:02:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 10:02:07,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:07,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:07,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:07,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:07,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-08 10:02:07,071 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 22 [2022-04-08 10:02:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:07,071 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-08 10:02:07,071 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:02:07,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-08 10:02:07,138 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:02:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-08 10:02:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:02:07,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:07,138 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:07,154 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:02:07,338 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:02:07,339 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1603850228, now seen corresponding path program 41 times [2022-04-08 10:02:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:07,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029735006] [2022-04-08 10:02:07,342 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:07,342 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1603850228, now seen corresponding path program 42 times [2022-04-08 10:02:07,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:07,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179101066] [2022-04-08 10:02:07,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:07,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {9863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {9847#true} is VALID [2022-04-08 10:02:07,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-08 10:02:07,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-08 10:02:07,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {9847#true} call ULTIMATE.init(); {9863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:07,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {9863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {9847#true} is VALID [2022-04-08 10:02:07,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-08 10:02:07,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-08 10:02:07,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {9847#true} call #t~ret9 := main(); {9847#true} is VALID [2022-04-08 10:02:07,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {9847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9852#(= main_~y~0 0)} is VALID [2022-04-08 10:02:07,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {9852#(= 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; {9853#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:07,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {9853#(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; {9854#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:07,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {9854#(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; {9855#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:07,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {9855#(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; {9856#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:07,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {9856#(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; {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:07,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:07,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9858#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:07,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {9858#(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; {9859#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:07,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {9859#(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; {9860#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:07,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {9860#(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; {9861#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:07,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {9861#(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; {9862#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:07,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {9862#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9848#false} is VALID [2022-04-08 10:02:07,504 INFO L272 TraceCheckUtils]: 18: Hoare triple {9848#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9848#false} is VALID [2022-04-08 10:02:07,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {9848#false} ~cond := #in~cond; {9848#false} is VALID [2022-04-08 10:02:07,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {9848#false} assume 0 == ~cond; {9848#false} is VALID [2022-04-08 10:02:07,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {9848#false} assume !false; {9848#false} is VALID [2022-04-08 10:02:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:07,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179101066] [2022-04-08 10:02:07,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179101066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083748287] [2022-04-08 10:02:07,505 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:07,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:07,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:07,506 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:02:07,507 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:02:07,537 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:02:07,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:07,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:02:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:07,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:07,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {9847#true} call ULTIMATE.init(); {9847#true} is VALID [2022-04-08 10:02:07,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {9847#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); {9847#true} is VALID [2022-04-08 10:02:07,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-08 10:02:07,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-08 10:02:07,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {9847#true} call #t~ret9 := main(); {9847#true} is VALID [2022-04-08 10:02:07,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {9847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9852#(= main_~y~0 0)} is VALID [2022-04-08 10:02:07,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {9852#(= 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; {9853#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:07,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {9853#(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; {9854#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:07,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {9854#(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; {9855#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:07,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {9855#(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; {9856#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:07,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {9856#(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; {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:07,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:07,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {9857#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9858#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:07,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {9858#(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; {9859#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:07,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {9859#(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; {9860#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:07,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {9860#(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; {9861#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:07,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {9861#(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; {9915#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:07,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {9915#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9848#false} is VALID [2022-04-08 10:02:07,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {9848#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9848#false} is VALID [2022-04-08 10:02:07,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {9848#false} ~cond := #in~cond; {9848#false} is VALID [2022-04-08 10:02:07,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {9848#false} assume 0 == ~cond; {9848#false} is VALID [2022-04-08 10:02:07,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {9848#false} assume !false; {9848#false} is VALID [2022-04-08 10:02:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:07,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:08,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {9848#false} assume !false; {9848#false} is VALID [2022-04-08 10:02:08,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {9848#false} assume 0 == ~cond; {9848#false} is VALID [2022-04-08 10:02:08,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {9848#false} ~cond := #in~cond; {9848#false} is VALID [2022-04-08 10:02:08,009 INFO L272 TraceCheckUtils]: 18: Hoare triple {9848#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9848#false} is VALID [2022-04-08 10:02:08,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {9943#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9848#false} is VALID [2022-04-08 10:02:08,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {9947#(< 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; {9943#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:08,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {9951#(< 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; {9947#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:08,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {9955#(< 0 (mod (+ main_~z~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; {9951#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:08,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {9959#(< 0 (mod (+ 4294967292 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; {9955#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:08,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {9963#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {9959#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:08,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {9963#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9963#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:08,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {9970#(< 0 (mod (+ main_~y~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; {9963#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:08,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#(< 0 (mod (+ main_~y~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; {9970#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:08,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {9978#(< 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; {9974#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:08,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {9982#(< 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; {9978#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:08,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {9986#(< 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; {9982#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:08,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {9847#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9986#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:08,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {9847#true} call #t~ret9 := main(); {9847#true} is VALID [2022-04-08 10:02:08,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9847#true} {9847#true} #50#return; {9847#true} is VALID [2022-04-08 10:02:08,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {9847#true} assume true; {9847#true} is VALID [2022-04-08 10:02:08,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {9847#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); {9847#true} is VALID [2022-04-08 10:02:08,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {9847#true} call ULTIMATE.init(); {9847#true} is VALID [2022-04-08 10:02:08,017 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:08,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083748287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:08,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:08,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:02:08,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:08,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2029735006] [2022-04-08 10:02:08,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2029735006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:08,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:08,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:02:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022888994] [2022-04-08 10:02:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:08,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:08,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:08,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:08,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:02:08,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:02:08,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:02:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:02:08,034 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:08,626 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-08 10:02:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:02:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2022-04-08 10:02:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2022-04-08 10:02:08,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2022-04-08 10:02:08,659 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:02:08,659 INFO L225 Difference]: With dead ends: 42 [2022-04-08 10:02:08,659 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 10:02:08,660 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:02:08,660 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:08,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:02:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 10:02:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-08 10:02:08,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:08,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:08,769 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:08,769 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:08,770 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 10:02:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 10:02:08,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:08,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:08,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 10:02:08,770 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-08 10:02:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:08,771 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 10:02:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 10:02:08,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:08,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:08,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:08,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-08 10:02:08,771 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-08 10:02:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:08,772 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-08 10:02:08,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:08,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-08 10:02:08,859 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:02:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:02:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:02:08,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:08,859 INFO L499 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:08,884 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:02:09,060 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:02:09,060 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:09,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash -636483637, now seen corresponding path program 43 times [2022-04-08 10:02:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:09,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433061922] [2022-04-08 10:02:09,064 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:09,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -636483637, now seen corresponding path program 44 times [2022-04-08 10:02:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:09,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546584446] [2022-04-08 10:02:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:09,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:09,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {10267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {10251#true} is VALID [2022-04-08 10:02:09,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-08 10:02:09,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-08 10:02:09,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {10251#true} call ULTIMATE.init(); {10267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:09,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {10267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {10251#true} is VALID [2022-04-08 10:02:09,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-08 10:02:09,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-08 10:02:09,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {10251#true} call #t~ret9 := main(); {10251#true} is VALID [2022-04-08 10:02:09,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {10251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10256#(= main_~y~0 0)} is VALID [2022-04-08 10:02:09,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {10256#(= 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; {10257#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:09,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {10257#(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; {10258#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:09,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {10258#(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; {10259#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:09,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {10259#(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; {10260#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:09,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {10260#(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; {10261#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:09,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {10261#(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; {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:09,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:09,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {10263#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:09,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {10263#(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; {10264#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:09,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {10264#(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; {10265#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:09,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {10265#(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; {10266#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:09,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {10266#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10252#false} is VALID [2022-04-08 10:02:09,235 INFO L272 TraceCheckUtils]: 18: Hoare triple {10252#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10252#false} is VALID [2022-04-08 10:02:09,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {10252#false} ~cond := #in~cond; {10252#false} is VALID [2022-04-08 10:02:09,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {10252#false} assume 0 == ~cond; {10252#false} is VALID [2022-04-08 10:02:09,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {10252#false} assume !false; {10252#false} is VALID [2022-04-08 10:02:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:09,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546584446] [2022-04-08 10:02:09,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546584446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:09,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351691607] [2022-04-08 10:02:09,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:09,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:09,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:09,237 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:02:09,237 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:02:09,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:09,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:09,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:02:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:09,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:09,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {10251#true} call ULTIMATE.init(); {10251#true} is VALID [2022-04-08 10:02:09,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {10251#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); {10251#true} is VALID [2022-04-08 10:02:09,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-08 10:02:09,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-08 10:02:09,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {10251#true} call #t~ret9 := main(); {10251#true} is VALID [2022-04-08 10:02:09,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {10251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10256#(= main_~y~0 0)} is VALID [2022-04-08 10:02:09,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {10256#(= 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; {10257#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:09,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {10257#(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; {10258#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:09,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {10258#(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; {10259#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:09,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {10259#(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; {10260#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:09,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {10260#(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; {10261#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:09,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {10261#(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; {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:09,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:09,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {10262#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {10263#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:09,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {10263#(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; {10264#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:09,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {10264#(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; {10265#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:09,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {10265#(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; {10319#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:09,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {10319#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10252#false} is VALID [2022-04-08 10:02:09,503 INFO L272 TraceCheckUtils]: 18: Hoare triple {10252#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10252#false} is VALID [2022-04-08 10:02:09,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {10252#false} ~cond := #in~cond; {10252#false} is VALID [2022-04-08 10:02:09,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {10252#false} assume 0 == ~cond; {10252#false} is VALID [2022-04-08 10:02:09,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {10252#false} assume !false; {10252#false} is VALID [2022-04-08 10:02:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:09,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:09,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {10252#false} assume !false; {10252#false} is VALID [2022-04-08 10:02:09,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {10252#false} assume 0 == ~cond; {10252#false} is VALID [2022-04-08 10:02:09,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {10252#false} ~cond := #in~cond; {10252#false} is VALID [2022-04-08 10:02:09,748 INFO L272 TraceCheckUtils]: 18: Hoare triple {10252#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10252#false} is VALID [2022-04-08 10:02:09,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {10347#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10252#false} is VALID [2022-04-08 10:02:09,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {10351#(< 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; {10347#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:09,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {10355#(< 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; {10351#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:09,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {10359#(< 0 (mod (+ main_~z~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; {10355#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:09,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {10363#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {10359#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:09,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {10363#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10363#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:09,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {10370#(< 0 (mod (+ main_~y~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; {10363#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:09,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {10374#(< 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; {10370#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:09,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {10378#(< 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; {10374#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:09,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {10382#(< 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; {10378#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:09,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {10386#(< 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; {10382#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:09,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {10390#(< 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; {10386#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:09,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {10251#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10390#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:09,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {10251#true} call #t~ret9 := main(); {10251#true} is VALID [2022-04-08 10:02:09,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10251#true} {10251#true} #50#return; {10251#true} is VALID [2022-04-08 10:02:09,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {10251#true} assume true; {10251#true} is VALID [2022-04-08 10:02:09,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {10251#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); {10251#true} is VALID [2022-04-08 10:02:09,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {10251#true} call ULTIMATE.init(); {10251#true} is VALID [2022-04-08 10:02:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:09,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351691607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:09,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:09,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:02:09,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:09,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433061922] [2022-04-08 10:02:09,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433061922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:09,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:09,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:02:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312406153] [2022-04-08 10:02:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:09,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:09,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:09,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:09,766 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:02:09,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:02:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:02:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:02:09,767 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:10,452 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 10:02:10,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:02:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-04-08 10:02:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-04-08 10:02:10,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 44 transitions. [2022-04-08 10:02:10,506 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:02:10,508 INFO L225 Difference]: With dead ends: 47 [2022-04-08 10:02:10,508 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 10:02:10,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:02:10,509 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:10,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 10:02:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2022-04-08 10:02:10,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:10,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:10,588 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:10,588 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:10,589 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 10:02:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 10:02:10,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:10,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:10,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 10:02:10,589 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 10:02:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:10,590 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 10:02:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 10:02:10,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:10,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:10,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:10,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-08 10:02:10,591 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-08 10:02:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:10,591 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-08 10:02:10,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:10,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-08 10:02:10,653 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:02:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:02:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:02:10,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:10,653 INFO L499 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:10,692 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:02:10,869 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:02:10,869 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1575109588, now seen corresponding path program 45 times [2022-04-08 10:02:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:10,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [313387113] [2022-04-08 10:02:10,872 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:10,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1575109588, now seen corresponding path program 46 times [2022-04-08 10:02:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:10,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280695529] [2022-04-08 10:02:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:11,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {10697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {10681#true} is VALID [2022-04-08 10:02:11,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-08 10:02:11,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-08 10:02:11,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {10681#true} call ULTIMATE.init(); {10697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:11,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {10697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {10681#true} is VALID [2022-04-08 10:02:11,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-08 10:02:11,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-08 10:02:11,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {10681#true} call #t~ret9 := main(); {10681#true} is VALID [2022-04-08 10:02:11,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {10681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10686#(= main_~y~0 0)} is VALID [2022-04-08 10:02:11,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {10686#(= 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; {10687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:11,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {10687#(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; {10688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:11,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {10688#(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; {10689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:11,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {10689#(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; {10690#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:11,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {10690#(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; {10691#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:11,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {10691#(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; {10692#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:11,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {10692#(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; {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:11,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:11,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {10694#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:11,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {10694#(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; {10695#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:11,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {10695#(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; {10696#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:11,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {10696#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {10682#false} is VALID [2022-04-08 10:02:11,030 INFO L272 TraceCheckUtils]: 18: Hoare triple {10682#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10682#false} is VALID [2022-04-08 10:02:11,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {10682#false} ~cond := #in~cond; {10682#false} is VALID [2022-04-08 10:02:11,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#false} assume 0 == ~cond; {10682#false} is VALID [2022-04-08 10:02:11,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {10682#false} assume !false; {10682#false} is VALID [2022-04-08 10:02:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280695529] [2022-04-08 10:02:11,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280695529] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875789816] [2022-04-08 10:02:11,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:11,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:11,032 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:02:11,033 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:02:11,063 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:11,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:11,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:02:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:11,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:11,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {10681#true} call ULTIMATE.init(); {10681#true} is VALID [2022-04-08 10:02:11,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {10681#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); {10681#true} is VALID [2022-04-08 10:02:11,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-08 10:02:11,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-08 10:02:11,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {10681#true} call #t~ret9 := main(); {10681#true} is VALID [2022-04-08 10:02:11,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {10681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10686#(= main_~y~0 0)} is VALID [2022-04-08 10:02:11,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {10686#(= 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; {10687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:11,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {10687#(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; {10688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:11,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {10688#(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; {10689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:11,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {10689#(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; {10690#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:11,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {10690#(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; {10691#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:11,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {10691#(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; {10692#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:11,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {10692#(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; {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:11,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:11,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {10693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {10694#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:11,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {10694#(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; {10695#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:11,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {10695#(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; {10749#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:11,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {10749#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {10682#false} is VALID [2022-04-08 10:02:11,222 INFO L272 TraceCheckUtils]: 18: Hoare triple {10682#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10682#false} is VALID [2022-04-08 10:02:11,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {10682#false} ~cond := #in~cond; {10682#false} is VALID [2022-04-08 10:02:11,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#false} assume 0 == ~cond; {10682#false} is VALID [2022-04-08 10:02:11,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {10682#false} assume !false; {10682#false} is VALID [2022-04-08 10:02:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:11,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:11,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {10682#false} assume !false; {10682#false} is VALID [2022-04-08 10:02:11,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#false} assume 0 == ~cond; {10682#false} is VALID [2022-04-08 10:02:11,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {10682#false} ~cond := #in~cond; {10682#false} is VALID [2022-04-08 10:02:11,386 INFO L272 TraceCheckUtils]: 18: Hoare triple {10682#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10682#false} is VALID [2022-04-08 10:02:11,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {10777#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10682#false} is VALID [2022-04-08 10:02:11,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {10781#(< 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; {10777#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:11,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {10785#(< 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; {10781#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:11,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {10789#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {10785#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:11,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {10789#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10789#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:11,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {10796#(< 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; {10789#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:11,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {10800#(< 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; {10796#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:11,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {10804#(< 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; {10800#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:11,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {10808#(< 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; {10804#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:11,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {10812#(< 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; {10808#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:11,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {10816#(< 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; {10812#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:11,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {10820#(< 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; {10816#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:11,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {10681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10820#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:11,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {10681#true} call #t~ret9 := main(); {10681#true} is VALID [2022-04-08 10:02:11,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10681#true} {10681#true} #50#return; {10681#true} is VALID [2022-04-08 10:02:11,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {10681#true} assume true; {10681#true} is VALID [2022-04-08 10:02:11,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {10681#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); {10681#true} is VALID [2022-04-08 10:02:11,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {10681#true} call ULTIMATE.init(); {10681#true} is VALID [2022-04-08 10:02:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:11,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875789816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:11,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:11,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:02:11,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:11,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [313387113] [2022-04-08 10:02:11,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [313387113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:11,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:11,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:02:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466049224] [2022-04-08 10:02:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:11,393 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:11,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:11,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:11,402 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:02:11,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:02:11,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:11,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:02:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:02:11,403 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:12,188 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-08 10:02:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:02:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2022-04-08 10:02:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2022-04-08 10:02:12,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 49 transitions. [2022-04-08 10:02:12,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:12,228 INFO L225 Difference]: With dead ends: 51 [2022-04-08 10:02:12,228 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 10:02:12,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:02:12,229 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:12,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 77 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 10:02:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2022-04-08 10:02:12,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:12,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:12,342 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:12,342 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:12,343 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-08 10:02:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 10:02:12,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:12,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:12,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 10:02:12,344 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-08 10:02:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:12,344 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-08 10:02:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 10:02:12,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:12,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:12,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:12,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-08 10:02:12,345 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-08 10:02:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:12,345 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-08 10:02:12,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:12,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-08 10:02:12,412 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:02:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:02:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:02:12,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:12,412 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:12,430 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:02:12,613 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:02:12,613 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2135390123, now seen corresponding path program 47 times [2022-04-08 10:02:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:12,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1965664683] [2022-04-08 10:02:12,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:12,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2135390123, now seen corresponding path program 48 times [2022-04-08 10:02:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:12,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536969650] [2022-04-08 10:02:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:12,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {11143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {11127#true} is VALID [2022-04-08 10:02:12,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-08 10:02:12,765 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-08 10:02:12,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {11127#true} call ULTIMATE.init(); {11143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:12,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {11143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {11127#true} is VALID [2022-04-08 10:02:12,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-08 10:02:12,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-08 10:02:12,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {11127#true} call #t~ret9 := main(); {11127#true} is VALID [2022-04-08 10:02:12,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {11127#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11132#(= main_~y~0 0)} is VALID [2022-04-08 10:02:12,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {11132#(= 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; {11133#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:12,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {11133#(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; {11134#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:12,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {11134#(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; {11135#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:12,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {11135#(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; {11136#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:12,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {11136#(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; {11137#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:12,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#(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; {11138#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:12,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {11138#(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; {11139#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:12,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {11139#(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; {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:12,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:12,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {11141#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:12,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {11141#(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; {11142#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:12,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {11142#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11128#false} is VALID [2022-04-08 10:02:12,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {11128#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11128#false} is VALID [2022-04-08 10:02:12,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {11128#false} ~cond := #in~cond; {11128#false} is VALID [2022-04-08 10:02:12,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {11128#false} assume 0 == ~cond; {11128#false} is VALID [2022-04-08 10:02:12,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {11128#false} assume !false; {11128#false} is VALID [2022-04-08 10:02:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:12,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:12,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536969650] [2022-04-08 10:02:12,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536969650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:12,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349222422] [2022-04-08 10:02:12,772 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:12,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:12,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:12,773 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:02:12,774 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:02:12,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:02:12,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:12,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:02:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:12,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:13,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {11127#true} call ULTIMATE.init(); {11127#true} is VALID [2022-04-08 10:02:13,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {11127#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); {11127#true} is VALID [2022-04-08 10:02:13,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-08 10:02:13,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-08 10:02:13,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {11127#true} call #t~ret9 := main(); {11127#true} is VALID [2022-04-08 10:02:13,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {11127#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11132#(= main_~y~0 0)} is VALID [2022-04-08 10:02:13,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {11132#(= 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; {11133#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:13,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {11133#(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; {11134#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:13,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {11134#(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; {11135#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:13,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {11135#(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; {11136#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:13,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {11136#(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; {11137#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:13,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#(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; {11138#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:13,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {11138#(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; {11139#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:13,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {11139#(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; {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:13,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:13,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {11140#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {11141#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:13,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {11141#(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; {11195#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:13,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {11195#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11128#false} is VALID [2022-04-08 10:02:13,045 INFO L272 TraceCheckUtils]: 18: Hoare triple {11128#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11128#false} is VALID [2022-04-08 10:02:13,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {11128#false} ~cond := #in~cond; {11128#false} is VALID [2022-04-08 10:02:13,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {11128#false} assume 0 == ~cond; {11128#false} is VALID [2022-04-08 10:02:13,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {11128#false} assume !false; {11128#false} is VALID [2022-04-08 10:02:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:13,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:13,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {11128#false} assume !false; {11128#false} is VALID [2022-04-08 10:02:13,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {11128#false} assume 0 == ~cond; {11128#false} is VALID [2022-04-08 10:02:13,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {11128#false} ~cond := #in~cond; {11128#false} is VALID [2022-04-08 10:02:13,262 INFO L272 TraceCheckUtils]: 18: Hoare triple {11128#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11128#false} is VALID [2022-04-08 10:02:13,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {11223#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11128#false} is VALID [2022-04-08 10:02:13,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {11227#(< 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; {11223#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:13,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {11231#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {11227#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:13,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {11231#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {11231#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:13,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {11238#(< 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; {11231#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:13,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {11242#(< 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; {11238#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:13,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {11246#(< 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; {11242#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:13,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {11250#(< 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; {11246#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:13,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {11254#(< 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; {11250#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:13,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {11258#(< 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; {11254#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:13,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {11262#(< 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; {11258#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:13,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {11266#(< 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; {11262#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:13,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {11127#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11266#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:13,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {11127#true} call #t~ret9 := main(); {11127#true} is VALID [2022-04-08 10:02:13,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11127#true} {11127#true} #50#return; {11127#true} is VALID [2022-04-08 10:02:13,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {11127#true} assume true; {11127#true} is VALID [2022-04-08 10:02:13,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {11127#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); {11127#true} is VALID [2022-04-08 10:02:13,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {11127#true} call ULTIMATE.init(); {11127#true} is VALID [2022-04-08 10:02:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:13,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349222422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:13,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:13,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:02:13,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:13,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1965664683] [2022-04-08 10:02:13,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1965664683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:13,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:13,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:02:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599701756] [2022-04-08 10:02:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:13,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:13,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:13,281 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:02:13,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:02:13,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:02:13,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:02:13,282 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:13,927 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 10:02:13,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:02:13,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-08 10:02:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-08 10:02:13,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2022-04-08 10:02:13,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:13,954 INFO L225 Difference]: With dead ends: 54 [2022-04-08 10:02:13,954 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 10:02:13,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:02:13,955 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:13,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 77 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 10:02:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2022-04-08 10:02:14,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:14,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:14,042 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:14,042 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:14,043 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-08 10:02:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-04-08 10:02:14,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:14,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:14,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 10:02:14,043 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 10:02:14,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:14,044 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-08 10:02:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-04-08 10:02:14,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:14,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:14,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:14,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-08 10:02:14,045 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2022-04-08 10:02:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:14,045 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-08 10:02:14,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:14,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-08 10:02:14,128 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:02:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:02:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:02:14,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:14,128 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:14,146 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:02:14,341 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:02:14,341 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 38326348, now seen corresponding path program 17 times [2022-04-08 10:02:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:14,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1539009357] [2022-04-08 10:02:14,344 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:14,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 38326348, now seen corresponding path program 18 times [2022-04-08 10:02:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:14,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895565903] [2022-04-08 10:02:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:14,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {11597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {11581#true} is VALID [2022-04-08 10:02:14,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-08 10:02:14,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-08 10:02:14,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {11581#true} call ULTIMATE.init(); {11597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:14,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {11597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {11581#true} is VALID [2022-04-08 10:02:14,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-08 10:02:14,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-08 10:02:14,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {11581#true} call #t~ret9 := main(); {11581#true} is VALID [2022-04-08 10:02:14,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {11581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11586#(= main_~y~0 0)} is VALID [2022-04-08 10:02:14,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {11586#(= 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; {11587#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:14,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {11587#(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; {11588#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:14,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {11588#(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; {11589#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:14,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {11589#(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; {11590#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:14,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {11590#(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; {11591#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:14,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {11591#(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; {11592#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:14,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {11592#(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; {11593#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:14,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {11593#(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; {11594#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:14,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {11594#(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; {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:14,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:14,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {11596#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:14,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {11596#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11582#false} is VALID [2022-04-08 10:02:14,508 INFO L272 TraceCheckUtils]: 18: Hoare triple {11582#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11582#false} is VALID [2022-04-08 10:02:14,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {11582#false} ~cond := #in~cond; {11582#false} is VALID [2022-04-08 10:02:14,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {11582#false} assume 0 == ~cond; {11582#false} is VALID [2022-04-08 10:02:14,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {11582#false} assume !false; {11582#false} is VALID [2022-04-08 10:02:14,509 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:02:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:14,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895565903] [2022-04-08 10:02:14,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895565903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:14,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889305267] [2022-04-08 10:02:14,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:14,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:14,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:14,510 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:02:14,511 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:02:14,556 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:02:14,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:14,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:02:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:14,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:14,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {11581#true} call ULTIMATE.init(); {11581#true} is VALID [2022-04-08 10:02:14,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {11581#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); {11581#true} is VALID [2022-04-08 10:02:14,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-08 10:02:14,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-08 10:02:14,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {11581#true} call #t~ret9 := main(); {11581#true} is VALID [2022-04-08 10:02:14,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {11581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11586#(= main_~y~0 0)} is VALID [2022-04-08 10:02:14,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {11586#(= 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; {11587#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:14,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {11587#(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; {11588#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:14,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {11588#(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; {11589#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:14,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {11589#(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; {11590#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:14,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {11590#(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; {11591#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:14,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {11591#(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; {11592#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:14,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {11592#(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; {11593#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:14,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {11593#(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; {11594#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:14,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {11594#(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; {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:14,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:14,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {11595#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {11649#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:14,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {11649#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {11582#false} is VALID [2022-04-08 10:02:14,791 INFO L272 TraceCheckUtils]: 18: Hoare triple {11582#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11582#false} is VALID [2022-04-08 10:02:14,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {11582#false} ~cond := #in~cond; {11582#false} is VALID [2022-04-08 10:02:14,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {11582#false} assume 0 == ~cond; {11582#false} is VALID [2022-04-08 10:02:14,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {11582#false} assume !false; {11582#false} is VALID [2022-04-08 10:02:14,791 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:02:14,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:15,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {11582#false} assume !false; {11582#false} is VALID [2022-04-08 10:02:15,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {11582#false} assume 0 == ~cond; {11582#false} is VALID [2022-04-08 10:02:15,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {11582#false} ~cond := #in~cond; {11582#false} is VALID [2022-04-08 10:02:15,039 INFO L272 TraceCheckUtils]: 18: Hoare triple {11582#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11582#false} is VALID [2022-04-08 10:02:15,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {11677#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11582#false} is VALID [2022-04-08 10:02:15,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {11681#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {11677#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:15,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {11681#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11681#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:15,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {11688#(< 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; {11681#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:15,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {11692#(< 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; {11688#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:15,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {11696#(< 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; {11692#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:15,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {11700#(< 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; {11696#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:15,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {11704#(< 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; {11700#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:15,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#(< 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; {11704#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:15,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {11712#(< 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; {11708#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:15,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {11716#(< 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; {11712#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:15,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {11720#(< 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; {11716#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:02:15,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {11581#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11720#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:02:15,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {11581#true} call #t~ret9 := main(); {11581#true} is VALID [2022-04-08 10:02:15,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11581#true} {11581#true} #50#return; {11581#true} is VALID [2022-04-08 10:02:15,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {11581#true} assume true; {11581#true} is VALID [2022-04-08 10:02:15,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {11581#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); {11581#true} is VALID [2022-04-08 10:02:15,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {11581#true} call ULTIMATE.init(); {11581#true} is VALID [2022-04-08 10:02:15,056 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:02:15,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889305267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:15,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:15,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:02:15,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:15,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1539009357] [2022-04-08 10:02:15,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1539009357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:15,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:15,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:02:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976638034] [2022-04-08 10:02:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:15,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:15,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:15,072 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:02:15,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:02:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:15,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:02:15,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:02:15,072 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:16,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:16,024 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-08 10:02:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:02:16,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-08 10:02:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-08 10:02:16,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-08 10:02:16,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:16,067 INFO L225 Difference]: With dead ends: 59 [2022-04-08 10:02:16,067 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 10:02:16,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:02:16,068 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:16,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 85 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:02:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 10:02:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2022-04-08 10:02:16,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:16,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:16,171 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:16,171 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:16,172 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-08 10:02:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-08 10:02:16,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:16,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:16,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-08 10:02:16,172 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-08 10:02:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:16,173 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-08 10:02:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-08 10:02:16,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:16,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:16,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:16,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-08 10:02:16,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2022-04-08 10:02:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:16,174 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-08 10:02:16,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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:02:16,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-08 10:02:16,251 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:02:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-08 10:02:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:02:16,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:16,252 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:16,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-08 10:02:16,452 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:02:16,452 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:16,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:16,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1854745558, now seen corresponding path program 49 times [2022-04-08 10:02:16,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:16,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573124568] [2022-04-08 10:02:16,455 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:16,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1854745558, now seen corresponding path program 50 times [2022-04-08 10:02:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931506046] [2022-04-08 10:02:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:16,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {12071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {12057#true} is VALID [2022-04-08 10:02:16,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-08 10:02:16,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-08 10:02:16,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {12057#true} call ULTIMATE.init(); {12071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:16,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {12071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {12057#true} is VALID [2022-04-08 10:02:16,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-08 10:02:16,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-08 10:02:16,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {12057#true} call #t~ret9 := main(); {12057#true} is VALID [2022-04-08 10:02:16,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {12057#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:16,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:02:16,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:02:16,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:02:16,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:02:16,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:02:16,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:02:16,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:02:16,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 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; {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:02:16,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ 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; {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:02:16,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:02:16,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:02:16,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12068#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:02:16,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {12068#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {12068#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:02:16,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {12068#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12069#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:02:16,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {12069#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12070#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:02:16,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {12070#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12058#false} is VALID [2022-04-08 10:02:16,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2022-04-08 10:02:16,649 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:02:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931506046] [2022-04-08 10:02:16,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931506046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123719270] [2022-04-08 10:02:16,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:16,650 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:02:16,684 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:02:16,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:16,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:16,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:02:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:16,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:16,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {12057#true} call ULTIMATE.init(); {12057#true} is VALID [2022-04-08 10:02:16,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {12057#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); {12057#true} is VALID [2022-04-08 10:02:16,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-08 10:02:16,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-08 10:02:16,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {12057#true} call #t~ret9 := main(); {12057#true} is VALID [2022-04-08 10:02:16,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {12057#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:16,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:02:16,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:02:16,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:02:16,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:02:16,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:02:16,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:02:16,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} ~z~0 := ~y~0; {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:02:16,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {12067#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 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; {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:02:16,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {12066#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ 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; {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:02:16,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {12065#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:02:16,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {12064#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:02:16,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {12063#(and (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:16,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:16,888 INFO L272 TraceCheckUtils]: 19: Hoare triple {12062#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:02:16,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {12132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:02:16,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {12136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12058#false} is VALID [2022-04-08 10:02:16,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2022-04-08 10:02:16,889 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:02:16,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:17,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {12058#false} assume !false; {12058#false} is VALID [2022-04-08 10:02:17,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {12136#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12058#false} is VALID [2022-04-08 10:02:17,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {12132#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12136#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:02:17,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {12152#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12132#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:02:17,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {12152#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12152#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:02:17,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {12159#(= (mod main_~n~0 4294967296) (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; {12152#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:02:17,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {12163#(= (mod main_~n~0 4294967296) (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; {12159#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:02:17,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {12167#(= (mod (+ main_~x~0 3) 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; {12163#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:02:17,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {12171#(= (mod main_~n~0 4294967296) (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; {12167#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:02:17,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {12175#(= (mod main_~n~0 4294967296) (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; {12171#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:02:17,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {12175#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} ~z~0 := ~y~0; {12175#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:02:17,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {12175#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12175#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:02:17,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {12171#(= (mod main_~n~0 4294967296) (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; {12175#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:02:17,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {12167#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~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; {12171#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:02:17,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {12163#(= (mod main_~n~0 4294967296) (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; {12167#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:02:17,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {12159#(= (mod main_~n~0 4294967296) (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; {12163#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:02:17,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {12152#(= (mod main_~n~0 4294967296) (mod 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; {12159#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:02:17,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {12057#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12152#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:02:17,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {12057#true} call #t~ret9 := main(); {12057#true} is VALID [2022-04-08 10:02:17,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12057#true} {12057#true} #50#return; {12057#true} is VALID [2022-04-08 10:02:17,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {12057#true} assume true; {12057#true} is VALID [2022-04-08 10:02:17,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {12057#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); {12057#true} is VALID [2022-04-08 10:02:17,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {12057#true} call ULTIMATE.init(); {12057#true} is VALID [2022-04-08 10:02:17,090 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:02:17,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123719270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:17,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:17,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 20 [2022-04-08 10:02:17,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:17,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573124568] [2022-04-08 10:02:17,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573124568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:17,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:17,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:02:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518143505] [2022-04-08 10:02:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:17,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:02:17,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:17,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,104 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:02:17,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:02:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:17,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:02:17,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:02:17,105 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:17,558 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-08 10:02:17,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:02:17,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 10:02:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-08 10:02:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-08 10:02:17,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-08 10:02:17,581 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:02:17,582 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:02:17,582 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 10:02:17,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:02:17,582 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:17,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 58 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:02:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 10:02:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-04-08 10:02:17,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:17,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,670 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,670 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:17,670 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 10:02:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 10:02:17,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:17,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:17,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 10:02:17,671 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 10:02:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:17,671 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 10:02:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 10:02:17,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:17,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:17,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:17,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 10:02:17,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-08 10:02:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:17,672 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 10:02:17,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:17,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 10:02:17,772 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:02:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:17,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:02:17,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:17,773 INFO L499 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:17,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-08 10:02:17,973 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:02:17,973 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1778338807, now seen corresponding path program 51 times [2022-04-08 10:02:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:17,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [139642270] [2022-04-08 10:02:17,976 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:17,976 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1778338807, now seen corresponding path program 52 times [2022-04-08 10:02:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:17,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270213154] [2022-04-08 10:02:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:18,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {12486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {12469#true} is VALID [2022-04-08 10:02:18,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-08 10:02:18,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-08 10:02:18,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {12469#true} call ULTIMATE.init(); {12486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:18,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {12486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {12469#true} is VALID [2022-04-08 10:02:18,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-08 10:02:18,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-08 10:02:18,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {12469#true} call #t~ret9 := main(); {12469#true} is VALID [2022-04-08 10:02:18,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {12469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12474#(= main_~y~0 0)} is VALID [2022-04-08 10:02:18,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {12474#(= 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; {12475#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:18,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {12475#(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; {12476#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:18,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {12476#(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; {12477#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:18,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {12477#(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; {12478#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:18,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {12478#(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; {12479#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:18,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {12479#(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; {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:18,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:18,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {12481#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:18,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {12481#(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; {12482#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:18,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {12482#(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; {12483#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:18,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {12483#(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; {12484#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:18,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {12484#(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; {12485#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:18,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {12485#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {12470#false} is VALID [2022-04-08 10:02:18,150 INFO L272 TraceCheckUtils]: 19: Hoare triple {12470#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12470#false} is VALID [2022-04-08 10:02:18,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {12470#false} ~cond := #in~cond; {12470#false} is VALID [2022-04-08 10:02:18,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {12470#false} assume 0 == ~cond; {12470#false} is VALID [2022-04-08 10:02:18,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {12470#false} assume !false; {12470#false} is VALID [2022-04-08 10:02:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270213154] [2022-04-08 10:02:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270213154] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:18,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482940408] [2022-04-08 10:02:18,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:18,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:18,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:18,152 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:02:18,167 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:02:18,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:18,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:18,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:02:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:18,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:18,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {12469#true} call ULTIMATE.init(); {12469#true} is VALID [2022-04-08 10:02:18,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {12469#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); {12469#true} is VALID [2022-04-08 10:02:18,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-08 10:02:18,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-08 10:02:18,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {12469#true} call #t~ret9 := main(); {12469#true} is VALID [2022-04-08 10:02:18,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {12469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12474#(= main_~y~0 0)} is VALID [2022-04-08 10:02:18,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {12474#(= 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; {12475#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:18,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {12475#(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; {12476#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:18,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {12476#(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; {12477#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:18,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {12477#(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; {12478#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:18,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {12478#(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; {12479#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:18,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {12479#(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; {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:18,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:18,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {12480#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {12481#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:18,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {12481#(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; {12482#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:18,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {12482#(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; {12483#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:18,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {12483#(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; {12484#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:18,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {12484#(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; {12541#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:18,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {12541#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {12470#false} is VALID [2022-04-08 10:02:18,442 INFO L272 TraceCheckUtils]: 19: Hoare triple {12470#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12470#false} is VALID [2022-04-08 10:02:18,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {12470#false} ~cond := #in~cond; {12470#false} is VALID [2022-04-08 10:02:18,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {12470#false} assume 0 == ~cond; {12470#false} is VALID [2022-04-08 10:02:18,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {12470#false} assume !false; {12470#false} is VALID [2022-04-08 10:02:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:18,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:18,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {12470#false} assume !false; {12470#false} is VALID [2022-04-08 10:02:18,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {12470#false} assume 0 == ~cond; {12470#false} is VALID [2022-04-08 10:02:18,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {12470#false} ~cond := #in~cond; {12470#false} is VALID [2022-04-08 10:02:18,715 INFO L272 TraceCheckUtils]: 19: Hoare triple {12470#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12470#false} is VALID [2022-04-08 10:02:18,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {12569#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12470#false} is VALID [2022-04-08 10:02:18,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {12573#(< 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; {12569#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:18,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {12577#(< 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; {12573#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:18,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {12581#(< 0 (mod (+ main_~z~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; {12577#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:18,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {12585#(< 0 (mod (+ 4294967292 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; {12581#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:18,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {12589#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {12585#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:18,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {12589#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12589#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:18,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {12596#(< 0 (mod (+ main_~y~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; {12589#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:18,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {12600#(< 0 (mod (+ main_~y~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; {12596#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:18,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {12604#(< 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; {12600#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:18,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {12608#(< 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; {12604#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:18,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {12612#(< 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; {12608#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:18,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {12616#(< 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; {12612#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:18,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {12469#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12616#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:18,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {12469#true} call #t~ret9 := main(); {12469#true} is VALID [2022-04-08 10:02:18,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12469#true} {12469#true} #50#return; {12469#true} is VALID [2022-04-08 10:02:18,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {12469#true} assume true; {12469#true} is VALID [2022-04-08 10:02:18,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {12469#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); {12469#true} is VALID [2022-04-08 10:02:18,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {12469#true} call ULTIMATE.init(); {12469#true} is VALID [2022-04-08 10:02:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482940408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:18,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:18,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:02:18,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:18,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [139642270] [2022-04-08 10:02:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [139642270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:18,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:18,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:02:18,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120494711] [2022-04-08 10:02:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:18,727 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:18,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:18,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:18,741 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:02:18,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:02:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:02:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:02:18,742 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:19,344 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-08 10:02:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:02:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2022-04-08 10:02:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2022-04-08 10:02:19,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 46 transitions. [2022-04-08 10:02:19,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:19,403 INFO L225 Difference]: With dead ends: 52 [2022-04-08 10:02:19,403 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:02:19,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:02:19,404 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:19,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 59 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:02:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:02:19,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-04-08 10:02:19,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:19,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:19,505 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:19,505 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:19,506 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-08 10:02:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-08 10:02:19,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:19,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:19,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:02:19,506 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:02:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:19,507 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-08 10:02:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-08 10:02:19,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:19,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:19,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:19,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 10:02:19,509 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-08 10:02:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:19,510 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 10:02:19,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:19,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 10:02:19,609 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:02:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:02:19,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:19,609 INFO L499 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:19,641 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:02:19,819 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:02:19,819 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1549261898, now seen corresponding path program 53 times [2022-04-08 10:02:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:19,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328342345] [2022-04-08 10:02:19,822 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:19,822 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1549261898, now seen corresponding path program 54 times [2022-04-08 10:02:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:19,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513807642] [2022-04-08 10:02:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:19,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:19,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:19,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {12954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {12937#true} is VALID [2022-04-08 10:02:19,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-08 10:02:19,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-08 10:02:19,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {12937#true} call ULTIMATE.init(); {12954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:19,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {12954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {12937#true} is VALID [2022-04-08 10:02:19,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-08 10:02:19,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-08 10:02:19,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#true} call #t~ret9 := main(); {12937#true} is VALID [2022-04-08 10:02:19,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {12937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12942#(= main_~y~0 0)} is VALID [2022-04-08 10:02:19,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {12942#(= 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; {12943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:19,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {12943#(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; {12944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:19,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {12944#(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; {12945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:19,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {12945#(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; {12946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:19,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {12946#(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; {12947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:19,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {12947#(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; {12948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:19,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {12948#(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; {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:19,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:19,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {12950#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:19,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(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; {12951#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:19,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {12951#(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; {12952#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:19,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {12952#(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; {12953#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:19,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {12953#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12938#false} is VALID [2022-04-08 10:02:19,937 INFO L272 TraceCheckUtils]: 19: Hoare triple {12938#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12938#false} is VALID [2022-04-08 10:02:19,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {12938#false} ~cond := #in~cond; {12938#false} is VALID [2022-04-08 10:02:19,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {12938#false} assume 0 == ~cond; {12938#false} is VALID [2022-04-08 10:02:19,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {12938#false} assume !false; {12938#false} is VALID [2022-04-08 10:02:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:19,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513807642] [2022-04-08 10:02:19,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513807642] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:19,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836051504] [2022-04-08 10:02:19,938 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:19,938 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:02:19,940 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:02:19,976 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:02:19,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:19,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:02:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:19,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:20,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {12937#true} call ULTIMATE.init(); {12937#true} is VALID [2022-04-08 10:02:20,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {12937#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); {12937#true} is VALID [2022-04-08 10:02:20,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-08 10:02:20,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-08 10:02:20,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#true} call #t~ret9 := main(); {12937#true} is VALID [2022-04-08 10:02:20,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {12937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12942#(= main_~y~0 0)} is VALID [2022-04-08 10:02:20,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {12942#(= 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; {12943#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:20,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {12943#(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; {12944#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:20,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {12944#(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; {12945#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:20,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {12945#(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; {12946#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:20,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {12946#(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; {12947#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:20,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {12947#(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; {12948#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:20,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {12948#(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; {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:20,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:20,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {12949#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {12950#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:20,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {12950#(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; {12951#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:20,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {12951#(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; {12952#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:20,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {12952#(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; {13009#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:20,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {13009#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {12938#false} is VALID [2022-04-08 10:02:20,147 INFO L272 TraceCheckUtils]: 19: Hoare triple {12938#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12938#false} is VALID [2022-04-08 10:02:20,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {12938#false} ~cond := #in~cond; {12938#false} is VALID [2022-04-08 10:02:20,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {12938#false} assume 0 == ~cond; {12938#false} is VALID [2022-04-08 10:02:20,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {12938#false} assume !false; {12938#false} is VALID [2022-04-08 10:02:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:20,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:20,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {12938#false} assume !false; {12938#false} is VALID [2022-04-08 10:02:20,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {12938#false} assume 0 == ~cond; {12938#false} is VALID [2022-04-08 10:02:20,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {12938#false} ~cond := #in~cond; {12938#false} is VALID [2022-04-08 10:02:20,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {12938#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12938#false} is VALID [2022-04-08 10:02:20,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {13037#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12938#false} is VALID [2022-04-08 10:02:20,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {13041#(< 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; {13037#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:20,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {13045#(< 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; {13041#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:20,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {13049#(< 0 (mod (+ main_~z~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; {13045#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:20,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {13053#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {13049#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:20,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {13053#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13053#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:20,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {13060#(< 0 (mod (+ main_~y~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; {13053#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:20,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {13064#(< 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; {13060#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:20,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {13068#(< 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; {13064#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:20,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {13072#(< 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; {13068#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:20,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {13076#(< 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; {13072#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:20,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {13080#(< 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; {13076#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:20,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {13084#(< 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; {13080#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:20,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {12937#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13084#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:20,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {12937#true} call #t~ret9 := main(); {12937#true} is VALID [2022-04-08 10:02:20,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12937#true} {12937#true} #50#return; {12937#true} is VALID [2022-04-08 10:02:20,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {12937#true} assume true; {12937#true} is VALID [2022-04-08 10:02:20,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {12937#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); {12937#true} is VALID [2022-04-08 10:02:20,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {12937#true} call ULTIMATE.init(); {12937#true} is VALID [2022-04-08 10:02:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:20,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836051504] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:20,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:20,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:02:20,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:20,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328342345] [2022-04-08 10:02:20,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328342345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:20,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:20,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:02:20,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196514013] [2022-04-08 10:02:20,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:20,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:20,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:20,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:20,349 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:02:20,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:02:20,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:02:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:02:20,349 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:21,082 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 10:02:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:02:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-04-08 10:02:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 52 transitions. [2022-04-08 10:02:21,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 52 transitions. [2022-04-08 10:02:21,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:21,121 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:02:21,121 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 10:02:21,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 10:02:21,122 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:21,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 10:02:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2022-04-08 10:02:21,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:21,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:21,264 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:21,264 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:21,265 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 10:02:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 10:02:21,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:21,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:21,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-08 10:02:21,265 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-08 10:02:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:21,266 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 10:02:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 10:02:21,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:21,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:21,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:21,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 10:02:21,266 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-08 10:02:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:21,267 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 10:02:21,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:21,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 10:02:21,365 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:02:21,365 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:02:21,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:21,365 INFO L499 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:21,381 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:02:21,566 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:02:21,566 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1807079447, now seen corresponding path program 55 times [2022-04-08 10:02:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:21,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703513882] [2022-04-08 10:02:21,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:21,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1807079447, now seen corresponding path program 56 times [2022-04-08 10:02:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:21,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190014962] [2022-04-08 10:02:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:21,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:21,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {13444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {13427#true} is VALID [2022-04-08 10:02:21,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-08 10:02:21,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-08 10:02:21,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {13427#true} call ULTIMATE.init(); {13444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:21,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {13444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {13427#true} is VALID [2022-04-08 10:02:21,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-08 10:02:21,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-08 10:02:21,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret9 := main(); {13427#true} is VALID [2022-04-08 10:02:21,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {13427#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13432#(= main_~y~0 0)} is VALID [2022-04-08 10:02:21,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {13432#(= 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; {13433#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:21,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {13433#(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; {13434#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:21,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {13434#(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; {13435#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:21,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {13435#(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; {13436#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:21,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {13436#(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; {13437#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:21,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {13437#(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; {13438#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:21,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {13438#(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; {13439#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:21,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {13439#(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; {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:21,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:21,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {13441#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:21,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {13441#(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; {13442#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:21,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {13442#(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; {13443#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:21,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {13443#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13428#false} is VALID [2022-04-08 10:02:21,712 INFO L272 TraceCheckUtils]: 19: Hoare triple {13428#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13428#false} is VALID [2022-04-08 10:02:21,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {13428#false} ~cond := #in~cond; {13428#false} is VALID [2022-04-08 10:02:21,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {13428#false} assume 0 == ~cond; {13428#false} is VALID [2022-04-08 10:02:21,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-08 10:02:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:21,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190014962] [2022-04-08 10:02:21,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190014962] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:21,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211924750] [2022-04-08 10:02:21,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:21,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:21,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:21,714 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:02:21,715 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:02:21,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:21,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:21,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:02:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:21,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:21,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {13427#true} call ULTIMATE.init(); {13427#true} is VALID [2022-04-08 10:02:21,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {13427#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); {13427#true} is VALID [2022-04-08 10:02:21,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-08 10:02:21,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-08 10:02:21,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret9 := main(); {13427#true} is VALID [2022-04-08 10:02:21,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {13427#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13432#(= main_~y~0 0)} is VALID [2022-04-08 10:02:21,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {13432#(= 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; {13433#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:21,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {13433#(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; {13434#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:21,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {13434#(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; {13435#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:21,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {13435#(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; {13436#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:21,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {13436#(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; {13437#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:21,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {13437#(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; {13438#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:21,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {13438#(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; {13439#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:21,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {13439#(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; {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:21,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:21,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {13440#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {13441#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:21,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {13441#(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; {13442#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:21,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {13442#(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; {13499#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:21,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {13499#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13428#false} is VALID [2022-04-08 10:02:21,904 INFO L272 TraceCheckUtils]: 19: Hoare triple {13428#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13428#false} is VALID [2022-04-08 10:02:21,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {13428#false} ~cond := #in~cond; {13428#false} is VALID [2022-04-08 10:02:21,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {13428#false} assume 0 == ~cond; {13428#false} is VALID [2022-04-08 10:02:21,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-08 10:02:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:21,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:22,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {13428#false} assume !false; {13428#false} is VALID [2022-04-08 10:02:22,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {13428#false} assume 0 == ~cond; {13428#false} is VALID [2022-04-08 10:02:22,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {13428#false} ~cond := #in~cond; {13428#false} is VALID [2022-04-08 10:02:22,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {13428#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13428#false} is VALID [2022-04-08 10:02:22,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {13527#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13428#false} is VALID [2022-04-08 10:02:22,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {13531#(< 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; {13527#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:22,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {13535#(< 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; {13531#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:22,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {13539#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {13535#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:22,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {13539#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13539#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:22,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {13546#(< 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; {13539#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:22,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {13550#(< 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; {13546#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:22,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {13554#(< 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; {13550#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:22,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {13558#(< 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; {13554#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:22,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {13562#(< 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; {13558#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:22,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {13566#(< 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; {13562#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:22,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {13570#(< 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; {13566#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:22,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {13574#(< 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; {13570#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:22,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {13427#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13574#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:22,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {13427#true} call #t~ret9 := main(); {13427#true} is VALID [2022-04-08 10:02:22,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13427#true} {13427#true} #50#return; {13427#true} is VALID [2022-04-08 10:02:22,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {13427#true} assume true; {13427#true} is VALID [2022-04-08 10:02:22,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {13427#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); {13427#true} is VALID [2022-04-08 10:02:22,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {13427#true} call ULTIMATE.init(); {13427#true} is VALID [2022-04-08 10:02:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:22,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211924750] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:22,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:22,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:02:22,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:22,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703513882] [2022-04-08 10:02:22,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703513882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:22,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:22,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:02:22,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652135360] [2022-04-08 10:02:22,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:22,139 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:22,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:22,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:22,151 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:02:22,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:02:22,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:22,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:02:22,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:02:22,152 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:23,095 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-08 10:02:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:02:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-08 10:02:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-08 10:02:23,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 55 transitions. [2022-04-08 10:02:23,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:23,127 INFO L225 Difference]: With dead ends: 61 [2022-04-08 10:02:23,127 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 10:02:23,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:02:23,132 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:23,132 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 76 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 10:02:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2022-04-08 10:02:23,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:23,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:23,248 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:23,248 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:23,252 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-04-08 10:02:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-04-08 10:02:23,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:23,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:23,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-08 10:02:23,252 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-08 10:02:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:23,253 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-04-08 10:02:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2022-04-08 10:02:23,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:23,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:23,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:23,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:23,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 10:02:23,267 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-08 10:02:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:23,267 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 10:02:23,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:23,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 10:02:23,369 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:02:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:02:23,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:23,370 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:23,401 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:02:23,570 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:02:23,571 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1222611862, now seen corresponding path program 57 times [2022-04-08 10:02:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971565594] [2022-04-08 10:02:23,574 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:23,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1222611862, now seen corresponding path program 58 times [2022-04-08 10:02:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:23,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561368963] [2022-04-08 10:02:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:23,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {13946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {13929#true} is VALID [2022-04-08 10:02:23,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-08 10:02:23,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-08 10:02:23,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {13929#true} call ULTIMATE.init(); {13946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:23,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {13946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {13929#true} is VALID [2022-04-08 10:02:23,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-08 10:02:23,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-08 10:02:23,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {13929#true} call #t~ret9 := main(); {13929#true} is VALID [2022-04-08 10:02:23,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {13929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13934#(= main_~y~0 0)} is VALID [2022-04-08 10:02:23,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {13934#(= 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; {13935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:23,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#(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; {13936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:23,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {13936#(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; {13937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:23,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {13937#(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; {13938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:23,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {13938#(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; {13939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:23,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {13939#(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; {13940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:23,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {13940#(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; {13941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:23,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {13941#(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; {13942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:23,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {13942#(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; {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:23,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:23,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {13944#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:23,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {13944#(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; {13945#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:23,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {13945#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13930#false} is VALID [2022-04-08 10:02:23,810 INFO L272 TraceCheckUtils]: 19: Hoare triple {13930#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13930#false} is VALID [2022-04-08 10:02:23,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {13930#false} ~cond := #in~cond; {13930#false} is VALID [2022-04-08 10:02:23,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {13930#false} assume 0 == ~cond; {13930#false} is VALID [2022-04-08 10:02:23,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {13930#false} assume !false; {13930#false} is VALID [2022-04-08 10:02:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:23,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:23,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561368963] [2022-04-08 10:02:23,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561368963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:23,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248061441] [2022-04-08 10:02:23,810 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:23,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:23,811 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:02:23,812 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:02:23,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:23,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:23,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:02:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:23,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:23,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {13929#true} call ULTIMATE.init(); {13929#true} is VALID [2022-04-08 10:02:23,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {13929#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); {13929#true} is VALID [2022-04-08 10:02:23,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-08 10:02:23,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-08 10:02:23,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {13929#true} call #t~ret9 := main(); {13929#true} is VALID [2022-04-08 10:02:23,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {13929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13934#(= main_~y~0 0)} is VALID [2022-04-08 10:02:23,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {13934#(= 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; {13935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:23,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#(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; {13936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:23,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {13936#(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; {13937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:23,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {13937#(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; {13938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:23,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {13938#(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; {13939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:23,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {13939#(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; {13940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:23,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {13940#(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; {13941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:24,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {13941#(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; {13942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:24,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {13942#(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; {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:24,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:24,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {13943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {13944#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:24,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {13944#(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; {14001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:24,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {14001#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {13930#false} is VALID [2022-04-08 10:02:24,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {13930#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13930#false} is VALID [2022-04-08 10:02:24,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {13930#false} ~cond := #in~cond; {13930#false} is VALID [2022-04-08 10:02:24,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {13930#false} assume 0 == ~cond; {13930#false} is VALID [2022-04-08 10:02:24,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {13930#false} assume !false; {13930#false} is VALID [2022-04-08 10:02:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:24,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:24,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {13930#false} assume !false; {13930#false} is VALID [2022-04-08 10:02:24,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {13930#false} assume 0 == ~cond; {13930#false} is VALID [2022-04-08 10:02:24,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {13930#false} ~cond := #in~cond; {13930#false} is VALID [2022-04-08 10:02:24,220 INFO L272 TraceCheckUtils]: 19: Hoare triple {13930#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13930#false} is VALID [2022-04-08 10:02:24,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {14029#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13930#false} is VALID [2022-04-08 10:02:24,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {14033#(< 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; {14029#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:24,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {14037#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {14033#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:24,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {14037#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14037#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:24,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {14044#(< 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; {14037#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:24,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {14048#(< 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; {14044#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:24,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {14052#(< 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; {14048#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:24,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {14056#(< 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; {14052#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:24,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {14060#(< 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; {14056#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:24,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {14064#(< 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; {14060#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:24,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {14068#(< 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; {14064#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:24,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {14072#(< 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; {14068#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:24,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {14076#(< 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; {14072#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:24,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {13929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14076#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:02:24,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {13929#true} call #t~ret9 := main(); {13929#true} is VALID [2022-04-08 10:02:24,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13929#true} {13929#true} #50#return; {13929#true} is VALID [2022-04-08 10:02:24,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {13929#true} assume true; {13929#true} is VALID [2022-04-08 10:02:24,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {13929#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); {13929#true} is VALID [2022-04-08 10:02:24,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {13929#true} call ULTIMATE.init(); {13929#true} is VALID [2022-04-08 10:02:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:24,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248061441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:24,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:02:24,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971565594] [2022-04-08 10:02:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971565594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:02:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019892700] [2022-04-08 10:02:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:24,238 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:24,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:24,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:24,249 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:02:24,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:02:24,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:02:24,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:02:24,250 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:25,175 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 10:02:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:02:25,175 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-08 10:02:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 58 transitions. [2022-04-08 10:02:25,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 58 transitions. [2022-04-08 10:02:25,220 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:02:25,228 INFO L225 Difference]: With dead ends: 64 [2022-04-08 10:02:25,228 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 10:02:25,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:02:25,229 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:25,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 86 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 10:02:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2022-04-08 10:02:25,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:25,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:25,340 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:25,340 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:25,341 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-08 10:02:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-04-08 10:02:25,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:25,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:25,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 10:02:25,341 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 10:02:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:25,342 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-08 10:02:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-04-08 10:02:25,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:25,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:25,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:25,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 10:02:25,343 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 23 [2022-04-08 10:02:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:25,343 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 10:02:25,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:25,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 10:02:25,434 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:02:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:02:25,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:25,435 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:25,450 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:02:25,647 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:02:25,647 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash -874451913, now seen corresponding path program 19 times [2022-04-08 10:02:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:25,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1815185184] [2022-04-08 10:02:25,663 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:25,663 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash -874451913, now seen corresponding path program 20 times [2022-04-08 10:02:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:25,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626675956] [2022-04-08 10:02:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:25,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:25,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {14456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {14439#true} is VALID [2022-04-08 10:02:25,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-08 10:02:25,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-08 10:02:25,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {14439#true} call ULTIMATE.init(); {14456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:25,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {14456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {14439#true} is VALID [2022-04-08 10:02:25,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-08 10:02:25,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-08 10:02:25,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {14439#true} call #t~ret9 := main(); {14439#true} is VALID [2022-04-08 10:02:25,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {14439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14444#(= main_~y~0 0)} is VALID [2022-04-08 10:02:25,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {14444#(= 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; {14445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:25,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {14445#(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; {14446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:25,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {14446#(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; {14447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:25,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {14447#(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; {14448#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:25,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {14448#(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; {14449#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:25,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {14449#(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; {14450#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:25,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {14450#(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; {14451#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:25,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {14451#(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; {14452#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:25,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {14452#(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; {14453#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:25,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {14453#(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; {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:25,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:25,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {14455#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:25,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {14455#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {14440#false} is VALID [2022-04-08 10:02:25,828 INFO L272 TraceCheckUtils]: 19: Hoare triple {14440#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14440#false} is VALID [2022-04-08 10:02:25,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {14440#false} ~cond := #in~cond; {14440#false} is VALID [2022-04-08 10:02:25,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {14440#false} assume 0 == ~cond; {14440#false} is VALID [2022-04-08 10:02:25,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {14440#false} assume !false; {14440#false} is VALID [2022-04-08 10:02:25,828 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:02:25,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:25,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626675956] [2022-04-08 10:02:25,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626675956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:25,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853324949] [2022-04-08 10:02:25,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:25,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:25,829 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:02:25,830 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:02:25,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:25,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:25,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:02:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:25,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:26,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {14439#true} call ULTIMATE.init(); {14439#true} is VALID [2022-04-08 10:02:26,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {14439#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); {14439#true} is VALID [2022-04-08 10:02:26,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-08 10:02:26,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-08 10:02:26,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {14439#true} call #t~ret9 := main(); {14439#true} is VALID [2022-04-08 10:02:26,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {14439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14444#(= main_~y~0 0)} is VALID [2022-04-08 10:02:26,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {14444#(= 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; {14445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:26,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {14445#(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; {14446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:26,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {14446#(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; {14447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:26,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {14447#(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; {14448#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:26,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {14448#(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; {14449#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:26,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {14449#(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; {14450#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:26,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {14450#(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; {14451#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:26,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {14451#(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; {14452#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:26,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {14452#(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; {14453#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:26,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {14453#(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; {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:26,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:26,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {14454#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {14511#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:02:26,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {14511#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14440#false} is VALID [2022-04-08 10:02:26,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {14440#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14440#false} is VALID [2022-04-08 10:02:26,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {14440#false} ~cond := #in~cond; {14440#false} is VALID [2022-04-08 10:02:26,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {14440#false} assume 0 == ~cond; {14440#false} is VALID [2022-04-08 10:02:26,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {14440#false} assume !false; {14440#false} is VALID [2022-04-08 10:02:26,101 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:02:26,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:26,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {14440#false} assume !false; {14440#false} is VALID [2022-04-08 10:02:26,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {14440#false} assume 0 == ~cond; {14440#false} is VALID [2022-04-08 10:02:26,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {14440#false} ~cond := #in~cond; {14440#false} is VALID [2022-04-08 10:02:26,382 INFO L272 TraceCheckUtils]: 19: Hoare triple {14440#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14440#false} is VALID [2022-04-08 10:02:26,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {14539#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14440#false} is VALID [2022-04-08 10:02:26,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {14543#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {14539#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:26,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {14543#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {14543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:26,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {14550#(< 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; {14543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:26,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {14554#(< 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; {14550#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:26,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {14558#(< 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; {14554#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:26,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {14562#(< 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; {14558#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:26,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {14566#(< 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; {14562#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:26,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {14570#(< 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; {14566#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:26,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {14574#(< 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; {14570#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:26,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {14578#(< 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; {14574#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:26,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {14582#(< 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; {14578#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:02:26,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {14586#(< 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; {14582#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:02:26,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {14439#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14586#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:02:26,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {14439#true} call #t~ret9 := main(); {14439#true} is VALID [2022-04-08 10:02:26,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14439#true} {14439#true} #50#return; {14439#true} is VALID [2022-04-08 10:02:26,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {14439#true} assume true; {14439#true} is VALID [2022-04-08 10:02:26,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {14439#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); {14439#true} is VALID [2022-04-08 10:02:26,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {14439#true} call ULTIMATE.init(); {14439#true} is VALID [2022-04-08 10:02:26,390 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:02:26,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853324949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:26,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:26,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:02:26,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:26,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1815185184] [2022-04-08 10:02:26,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1815185184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:26,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:26,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:02:26,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476215537] [2022-04-08 10:02:26,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:26,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:26,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:26,406 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:02:26,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:02:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:02:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:02:26,406 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:27,568 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-08 10:02:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:02:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-08 10:02:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-08 10:02:27,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-08 10:02:27,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:27,600 INFO L225 Difference]: With dead ends: 69 [2022-04-08 10:02:27,600 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 10:02:27,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 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:02:27,600 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:27,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 94 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:02:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 10:02:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 37. [2022-04-08 10:02:27,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:27,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:27,713 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:27,713 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:27,714 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 10:02:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 10:02:27,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:27,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:27,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 10:02:27,715 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 10:02:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:27,716 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 10:02:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 10:02:27,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:27,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:27,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:27,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-08 10:02:27,717 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 23 [2022-04-08 10:02:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:27,717 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-08 10:02:27,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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:02:27,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-08 10:02:27,834 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:02:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 10:02:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:02:27,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:27,834 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:27,869 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:02:28,050 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:02:28,050 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1697032524, now seen corresponding path program 59 times [2022-04-08 10:02:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:28,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369014844] [2022-04-08 10:02:28,052 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:28,052 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1697032524, now seen corresponding path program 60 times [2022-04-08 10:02:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:28,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925835704] [2022-04-08 10:02:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:28,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {14988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {14971#true} is VALID [2022-04-08 10:02:28,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-08 10:02:28,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-08 10:02:28,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {14971#true} call ULTIMATE.init(); {14988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:28,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {14988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {14971#true} is VALID [2022-04-08 10:02:28,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-08 10:02:28,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-08 10:02:28,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {14971#true} call #t~ret9 := main(); {14971#true} is VALID [2022-04-08 10:02:28,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {14971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14976#(= main_~y~0 0)} is VALID [2022-04-08 10:02:28,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {14976#(= 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; {14977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:28,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {14977#(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; {14978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:28,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {14978#(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; {14979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:28,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {14979#(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; {14980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:28,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {14980#(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; {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:28,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:28,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {14982#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:28,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {14982#(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; {14983#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:28,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {14983#(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; {14984#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:28,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {14984#(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; {14985#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:28,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {14985#(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; {14986#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:28,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {14986#(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; {14987#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:02:28,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {14987#(and (<= main_~z~0 0) (<= 0 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; {14972#false} is VALID [2022-04-08 10:02:28,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {14972#false} assume !(~z~0 % 4294967296 > 0); {14972#false} is VALID [2022-04-08 10:02:28,237 INFO L272 TraceCheckUtils]: 20: Hoare triple {14972#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14972#false} is VALID [2022-04-08 10:02:28,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {14972#false} ~cond := #in~cond; {14972#false} is VALID [2022-04-08 10:02:28,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {14972#false} assume 0 == ~cond; {14972#false} is VALID [2022-04-08 10:02:28,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#false} assume !false; {14972#false} is VALID [2022-04-08 10:02:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:28,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925835704] [2022-04-08 10:02:28,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925835704] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:28,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050005191] [2022-04-08 10:02:28,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:28,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:28,239 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:02:28,240 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:02:28,282 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:02:28,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:28,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:02:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:28,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:28,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {14971#true} call ULTIMATE.init(); {14971#true} is VALID [2022-04-08 10:02:28,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {14971#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); {14971#true} is VALID [2022-04-08 10:02:28,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-08 10:02:28,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-08 10:02:28,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {14971#true} call #t~ret9 := main(); {14971#true} is VALID [2022-04-08 10:02:28,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {14971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14976#(= main_~y~0 0)} is VALID [2022-04-08 10:02:28,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {14976#(= 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; {14977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:28,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {14977#(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; {14978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:28,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {14978#(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; {14979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:28,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {14979#(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; {14980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:28,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {14980#(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; {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:28,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:28,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {14981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {14982#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:28,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {14982#(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; {14983#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:28,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {14983#(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; {14984#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:28,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {14984#(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; {14985#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:28,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {14985#(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; {14986#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:28,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {14986#(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; {14987#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:02:28,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {14987#(and (<= main_~z~0 0) (<= 0 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; {15046#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:02:28,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {15046#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {14972#false} is VALID [2022-04-08 10:02:28,545 INFO L272 TraceCheckUtils]: 20: Hoare triple {14972#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14972#false} is VALID [2022-04-08 10:02:28,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {14972#false} ~cond := #in~cond; {14972#false} is VALID [2022-04-08 10:02:28,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {14972#false} assume 0 == ~cond; {14972#false} is VALID [2022-04-08 10:02:28,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#false} assume !false; {14972#false} is VALID [2022-04-08 10:02:28,545 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:02:28,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:28,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {14972#false} assume !false; {14972#false} is VALID [2022-04-08 10:02:28,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {14972#false} assume 0 == ~cond; {14972#false} is VALID [2022-04-08 10:02:28,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {14972#false} ~cond := #in~cond; {14972#false} is VALID [2022-04-08 10:02:28,879 INFO L272 TraceCheckUtils]: 20: Hoare triple {14972#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14972#false} is VALID [2022-04-08 10:02:28,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {15074#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {14972#false} is VALID [2022-04-08 10:02:28,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {15078#(< 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; {15074#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:28,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {15082#(< 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; {15078#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:28,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {15086#(< 0 (mod (+ main_~z~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; {15082#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:28,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {15090#(< 0 (mod (+ 4294967292 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; {15086#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:28,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {15094#(< 0 (mod (+ 4294967291 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; {15090#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:28,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {15098#(< 0 (mod (+ 4294967290 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; {15094#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:28,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {15102#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {15098#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:28,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {15102#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15102#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:28,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {15109#(< 0 (mod (+ 4294967291 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; {15102#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:28,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {15113#(< 0 (mod (+ 4294967292 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; {15109#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:28,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {15117#(< 0 (mod (+ main_~y~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; {15113#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:28,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {15121#(< 0 (mod (+ main_~y~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; {15117#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:28,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {15125#(< 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; {15121#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:28,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {14971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15125#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:28,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {14971#true} call #t~ret9 := main(); {14971#true} is VALID [2022-04-08 10:02:28,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14971#true} {14971#true} #50#return; {14971#true} is VALID [2022-04-08 10:02:28,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {14971#true} assume true; {14971#true} is VALID [2022-04-08 10:02:28,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {14971#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); {14971#true} is VALID [2022-04-08 10:02:28,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {14971#true} call ULTIMATE.init(); {14971#true} is VALID [2022-04-08 10:02:28,888 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:02:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050005191] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:28,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2022-04-08 10:02:28,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:28,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369014844] [2022-04-08 10:02:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369014844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:28,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:02:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984786388] [2022-04-08 10:02:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:28,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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:02:28,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:28,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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:02:28,905 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:02:28,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:02:28,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:28,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:02:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:02:28,906 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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:02:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:29,647 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-08 10:02:29,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:02:29,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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:02:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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:02:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2022-04-08 10:02:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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:02:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2022-04-08 10:02:29,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 35 transitions. [2022-04-08 10:02:29,675 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:02:29,675 INFO L225 Difference]: With dead ends: 48 [2022-04-08 10:02:29,675 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 10:02:29,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:02:29,676 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:29,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 10:02:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 10:02:29,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:29,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:29,813 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:29,813 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:29,813 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 10:02:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:29,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:29,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:29,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 10:02:29,814 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 10:02:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:29,814 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 10:02:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:29,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:29,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:29,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:29,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 10:02:29,815 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 24 [2022-04-08 10:02:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:29,815 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 10:02:29,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 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:02:29,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 10:02:29,924 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:02:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 10:02:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:02:29,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:29,925 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:29,959 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:02:30,125 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:02:30,126 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:30,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash -671576757, now seen corresponding path program 61 times [2022-04-08 10:02:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:30,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [534135745] [2022-04-08 10:02:30,129 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:30,129 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash -671576757, now seen corresponding path program 62 times [2022-04-08 10:02:30,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:30,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733245662] [2022-04-08 10:02:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:30,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {15424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {15406#true} is VALID [2022-04-08 10:02:30,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-08 10:02:30,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-08 10:02:30,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {15406#true} call ULTIMATE.init(); {15424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:30,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {15424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {15406#true} is VALID [2022-04-08 10:02:30,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-08 10:02:30,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-08 10:02:30,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {15406#true} call #t~ret9 := main(); {15406#true} is VALID [2022-04-08 10:02:30,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {15406#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15411#(= main_~y~0 0)} is VALID [2022-04-08 10:02:30,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {15411#(= 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; {15412#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:30,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {15412#(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; {15413#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:30,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {15413#(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; {15414#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:30,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {15414#(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; {15415#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:30,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {15415#(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; {15416#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:30,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {15416#(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; {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:30,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:30,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {15418#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:30,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {15418#(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; {15419#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:30,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {15419#(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; {15420#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:30,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {15420#(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; {15421#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:30,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {15421#(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; {15422#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:30,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {15422#(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; {15423#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:30,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {15423#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {15407#false} is VALID [2022-04-08 10:02:30,323 INFO L272 TraceCheckUtils]: 20: Hoare triple {15407#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15407#false} is VALID [2022-04-08 10:02:30,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {15407#false} ~cond := #in~cond; {15407#false} is VALID [2022-04-08 10:02:30,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {15407#false} assume 0 == ~cond; {15407#false} is VALID [2022-04-08 10:02:30,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {15407#false} assume !false; {15407#false} is VALID [2022-04-08 10:02:30,324 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:02:30,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:30,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733245662] [2022-04-08 10:02:30,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733245662] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:30,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988912083] [2022-04-08 10:02:30,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:30,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:30,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:30,325 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:02:30,326 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:02:30,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:30,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:30,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:02:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:30,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:30,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {15406#true} call ULTIMATE.init(); {15406#true} is VALID [2022-04-08 10:02:30,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {15406#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); {15406#true} is VALID [2022-04-08 10:02:30,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-08 10:02:30,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-08 10:02:30,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {15406#true} call #t~ret9 := main(); {15406#true} is VALID [2022-04-08 10:02:30,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {15406#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15411#(= main_~y~0 0)} is VALID [2022-04-08 10:02:30,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {15411#(= 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; {15412#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:30,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {15412#(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; {15413#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:30,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {15413#(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; {15414#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:30,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {15414#(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; {15415#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:30,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {15415#(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; {15416#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:30,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {15416#(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; {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:30,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:30,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {15417#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {15418#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:30,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {15418#(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; {15419#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:30,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {15419#(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; {15420#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:30,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {15420#(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; {15421#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:30,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {15421#(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; {15422#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:30,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {15422#(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; {15482#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:02:30,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {15482#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {15407#false} is VALID [2022-04-08 10:02:30,639 INFO L272 TraceCheckUtils]: 20: Hoare triple {15407#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15407#false} is VALID [2022-04-08 10:02:30,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {15407#false} ~cond := #in~cond; {15407#false} is VALID [2022-04-08 10:02:30,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {15407#false} assume 0 == ~cond; {15407#false} is VALID [2022-04-08 10:02:30,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {15407#false} assume !false; {15407#false} is VALID [2022-04-08 10:02:30,639 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:02:30,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:30,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {15407#false} assume !false; {15407#false} is VALID [2022-04-08 10:02:30,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {15407#false} assume 0 == ~cond; {15407#false} is VALID [2022-04-08 10:02:30,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {15407#false} ~cond := #in~cond; {15407#false} is VALID [2022-04-08 10:02:30,856 INFO L272 TraceCheckUtils]: 20: Hoare triple {15407#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15407#false} is VALID [2022-04-08 10:02:30,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {15510#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15407#false} is VALID [2022-04-08 10:02:30,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {15514#(< 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; {15510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:30,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {15518#(< 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; {15514#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:30,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {15522#(< 0 (mod (+ main_~z~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; {15518#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:30,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {15526#(< 0 (mod (+ 4294967292 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; {15522#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:30,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {15530#(< 0 (mod (+ 4294967291 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; {15526#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:30,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {15534#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {15530#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:30,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {15534#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15534#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:30,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {15541#(< 0 (mod (+ 4294967292 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; {15534#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:30,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {15545#(< 0 (mod (+ main_~y~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; {15541#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:30,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {15549#(< 0 (mod (+ main_~y~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; {15545#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:30,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {15553#(< 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; {15549#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:30,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {15557#(< 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; {15553#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:30,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {15561#(< 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; {15557#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:30,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {15406#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15561#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:30,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {15406#true} call #t~ret9 := main(); {15406#true} is VALID [2022-04-08 10:02:30,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15406#true} {15406#true} #50#return; {15406#true} is VALID [2022-04-08 10:02:30,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {15406#true} assume true; {15406#true} is VALID [2022-04-08 10:02:30,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {15406#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); {15406#true} is VALID [2022-04-08 10:02:30,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {15406#true} call ULTIMATE.init(); {15406#true} is VALID [2022-04-08 10:02:30,863 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:02:30,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988912083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:30,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:30,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:02:30,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:30,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [534135745] [2022-04-08 10:02:30,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [534135745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:30,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:30,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:02:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422488106] [2022-04-08 10:02:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:30,864 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:30,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:30,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:30,874 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:02:30,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:02:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:30,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:02:30,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:02:30,874 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:31,380 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 10:02:31,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:02:31,380 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2022-04-08 10:02:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 38 transitions. [2022-04-08 10:02:31,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 38 transitions. [2022-04-08 10:02:31,400 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:02:31,400 INFO L225 Difference]: With dead ends: 47 [2022-04-08 10:02:31,400 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 10:02:31,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:02:31,401 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:31,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:02:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 10:02:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-04-08 10:02:31,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:31,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:31,553 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:31,553 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:31,554 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 10:02:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 10:02:31,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:31,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:31,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 10:02:31,555 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-08 10:02:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:31,555 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-08 10:02:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-08 10:02:31,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:31,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:31,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:31,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-08 10:02:31,556 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-08 10:02:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:31,556 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-08 10:02:31,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:31,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-08 10:02:31,667 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:02:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 10:02:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:02:31,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:31,667 INFO L499 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:31,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 10:02:31,867 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:02:31,868 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:31,868 INFO L85 PathProgramCache]: Analyzing trace with hash -747983508, now seen corresponding path program 63 times [2022-04-08 10:02:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:31,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [911108503] [2022-04-08 10:02:31,870 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:31,870 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash -747983508, now seen corresponding path program 64 times [2022-04-08 10:02:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:31,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175654198] [2022-04-08 10:02:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:32,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {15876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {15858#true} is VALID [2022-04-08 10:02:32,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-08 10:02:32,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-08 10:02:32,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {15858#true} call ULTIMATE.init(); {15876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:32,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {15876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {15858#true} is VALID [2022-04-08 10:02:32,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-08 10:02:32,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-08 10:02:32,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {15858#true} call #t~ret9 := main(); {15858#true} is VALID [2022-04-08 10:02:32,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {15858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15863#(= main_~y~0 0)} is VALID [2022-04-08 10:02:32,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {15863#(= 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; {15864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:32,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {15864#(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; {15865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:32,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {15865#(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; {15866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:32,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {15866#(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; {15867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:32,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {15867#(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; {15868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:32,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {15868#(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; {15869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:32,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {15869#(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; {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:32,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:32,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {15871#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:32,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {15871#(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; {15872#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:32,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {15872#(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; {15873#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:32,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {15873#(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; {15874#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:32,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {15874#(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; {15875#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:32,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {15875#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15859#false} is VALID [2022-04-08 10:02:32,053 INFO L272 TraceCheckUtils]: 20: Hoare triple {15859#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15859#false} is VALID [2022-04-08 10:02:32,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {15859#false} ~cond := #in~cond; {15859#false} is VALID [2022-04-08 10:02:32,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {15859#false} assume 0 == ~cond; {15859#false} is VALID [2022-04-08 10:02:32,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {15859#false} assume !false; {15859#false} is VALID [2022-04-08 10:02:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:32,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175654198] [2022-04-08 10:02:32,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175654198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:32,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436609160] [2022-04-08 10:02:32,053 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:32,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:32,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:32,054 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:02:32,055 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:02:32,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:32,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:32,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:02:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:32,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:32,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {15858#true} call ULTIMATE.init(); {15858#true} is VALID [2022-04-08 10:02:32,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {15858#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); {15858#true} is VALID [2022-04-08 10:02:32,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-08 10:02:32,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-08 10:02:32,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {15858#true} call #t~ret9 := main(); {15858#true} is VALID [2022-04-08 10:02:32,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {15858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15863#(= main_~y~0 0)} is VALID [2022-04-08 10:02:32,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {15863#(= 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; {15864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:32,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {15864#(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; {15865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:32,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {15865#(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; {15866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:32,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {15866#(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; {15867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:32,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {15867#(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; {15868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:32,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {15868#(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; {15869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:32,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {15869#(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; {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:32,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:32,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {15870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {15871#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:32,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {15871#(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; {15872#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:32,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {15872#(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; {15873#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:32,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {15873#(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; {15874#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:32,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {15874#(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; {15934#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:32,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {15934#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {15859#false} is VALID [2022-04-08 10:02:32,340 INFO L272 TraceCheckUtils]: 20: Hoare triple {15859#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15859#false} is VALID [2022-04-08 10:02:32,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {15859#false} ~cond := #in~cond; {15859#false} is VALID [2022-04-08 10:02:32,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {15859#false} assume 0 == ~cond; {15859#false} is VALID [2022-04-08 10:02:32,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {15859#false} assume !false; {15859#false} is VALID [2022-04-08 10:02:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:32,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:32,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {15859#false} assume !false; {15859#false} is VALID [2022-04-08 10:02:32,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {15859#false} assume 0 == ~cond; {15859#false} is VALID [2022-04-08 10:02:32,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {15859#false} ~cond := #in~cond; {15859#false} is VALID [2022-04-08 10:02:32,641 INFO L272 TraceCheckUtils]: 20: Hoare triple {15859#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15859#false} is VALID [2022-04-08 10:02:32,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {15962#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15859#false} is VALID [2022-04-08 10:02:32,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {15966#(< 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; {15962#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:32,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {15970#(< 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; {15966#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:32,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {15974#(< 0 (mod (+ main_~z~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; {15970#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:32,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {15978#(< 0 (mod (+ 4294967292 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; {15974#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:32,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {15982#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {15978#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:32,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {15982#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15982#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:32,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {15989#(< 0 (mod (+ main_~y~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; {15982#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:32,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {15993#(< 0 (mod (+ main_~y~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; {15989#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:32,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {15997#(< 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; {15993#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:32,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {16001#(< 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; {15997#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:32,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {16005#(< 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; {16001#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:32,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {16009#(< 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; {16005#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:32,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {16013#(< 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; {16009#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:32,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {15858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16013#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:32,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {15858#true} call #t~ret9 := main(); {15858#true} is VALID [2022-04-08 10:02:32,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15858#true} {15858#true} #50#return; {15858#true} is VALID [2022-04-08 10:02:32,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {15858#true} assume true; {15858#true} is VALID [2022-04-08 10:02:32,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {15858#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); {15858#true} is VALID [2022-04-08 10:02:32,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {15858#true} call ULTIMATE.init(); {15858#true} is VALID [2022-04-08 10:02:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:32,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436609160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:32,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:32,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:02:32,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [911108503] [2022-04-08 10:02:32,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [911108503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:32,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:32,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:02:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768675283] [2022-04-08 10:02:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:32,650 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:32,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:32,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:32,661 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:02:32,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:02:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:02:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:02:32,662 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:33,422 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 10:02:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:02:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2022-04-08 10:02:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2022-04-08 10:02:33,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 47 transitions. [2022-04-08 10:02:33,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:33,446 INFO L225 Difference]: With dead ends: 53 [2022-04-08 10:02:33,447 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 10:02:33,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:02:33,447 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:33,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 84 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 10:02:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2022-04-08 10:02:33,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:33,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:33,538 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:33,538 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:33,538 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-08 10:02:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-04-08 10:02:33,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:33,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:33,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 48 states. [2022-04-08 10:02:33,539 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 48 states. [2022-04-08 10:02:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:33,539 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-08 10:02:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-04-08 10:02:33,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:33,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:33,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:33,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-08 10:02:33,540 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-08 10:02:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:33,540 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-08 10:02:33,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:33,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-08 10:02:33,649 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:02:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 10:02:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:02:33,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:33,650 INFO L499 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:33,666 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:02:33,865 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:02:33,866 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 219383083, now seen corresponding path program 65 times [2022-04-08 10:02:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:33,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715560528] [2022-04-08 10:02:33,868 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:33,868 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 219383083, now seen corresponding path program 66 times [2022-04-08 10:02:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:33,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139006135] [2022-04-08 10:02:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:34,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:34,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {16360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {16342#true} is VALID [2022-04-08 10:02:34,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-08 10:02:34,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-08 10:02:34,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {16342#true} call ULTIMATE.init(); {16360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:34,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {16360#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {16342#true} is VALID [2022-04-08 10:02:34,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-08 10:02:34,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-08 10:02:34,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {16342#true} call #t~ret9 := main(); {16342#true} is VALID [2022-04-08 10:02:34,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {16342#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16347#(= main_~y~0 0)} is VALID [2022-04-08 10:02:34,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {16347#(= 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; {16348#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:34,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {16348#(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; {16349#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:34,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {16349#(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; {16350#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:34,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {16350#(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; {16351#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:34,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {16351#(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; {16352#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:34,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {16352#(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; {16353#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:34,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {16353#(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; {16354#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:34,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {16354#(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; {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:34,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:34,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {16356#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:34,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {16356#(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; {16357#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:34,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {16357#(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; {16358#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:34,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {16358#(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; {16359#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:34,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {16359#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16343#false} is VALID [2022-04-08 10:02:34,074 INFO L272 TraceCheckUtils]: 20: Hoare triple {16343#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16343#false} is VALID [2022-04-08 10:02:34,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {16343#false} ~cond := #in~cond; {16343#false} is VALID [2022-04-08 10:02:34,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {16343#false} assume 0 == ~cond; {16343#false} is VALID [2022-04-08 10:02:34,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {16343#false} assume !false; {16343#false} is VALID [2022-04-08 10:02:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:34,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139006135] [2022-04-08 10:02:34,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139006135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:34,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108229170] [2022-04-08 10:02:34,075 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:34,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:34,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:34,075 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:02:34,076 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:02:34,119 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:02:34,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:34,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:02:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:34,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:34,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {16342#true} call ULTIMATE.init(); {16342#true} is VALID [2022-04-08 10:02:34,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {16342#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); {16342#true} is VALID [2022-04-08 10:02:34,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-08 10:02:34,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-08 10:02:34,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {16342#true} call #t~ret9 := main(); {16342#true} is VALID [2022-04-08 10:02:34,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {16342#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16347#(= main_~y~0 0)} is VALID [2022-04-08 10:02:34,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {16347#(= 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; {16348#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:34,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {16348#(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; {16349#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:34,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {16349#(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; {16350#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:34,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {16350#(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; {16351#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:34,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {16351#(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; {16352#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:34,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {16352#(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; {16353#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:34,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {16353#(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; {16354#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:34,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {16354#(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; {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:34,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:34,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {16355#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {16356#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:34,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {16356#(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; {16357#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:34,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {16357#(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; {16358#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:34,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {16358#(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; {16418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:34,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {16418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16343#false} is VALID [2022-04-08 10:02:34,347 INFO L272 TraceCheckUtils]: 20: Hoare triple {16343#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16343#false} is VALID [2022-04-08 10:02:34,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {16343#false} ~cond := #in~cond; {16343#false} is VALID [2022-04-08 10:02:34,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {16343#false} assume 0 == ~cond; {16343#false} is VALID [2022-04-08 10:02:34,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {16343#false} assume !false; {16343#false} is VALID [2022-04-08 10:02:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:34,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:34,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {16343#false} assume !false; {16343#false} is VALID [2022-04-08 10:02:34,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {16343#false} assume 0 == ~cond; {16343#false} is VALID [2022-04-08 10:02:34,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {16343#false} ~cond := #in~cond; {16343#false} is VALID [2022-04-08 10:02:34,663 INFO L272 TraceCheckUtils]: 20: Hoare triple {16343#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16343#false} is VALID [2022-04-08 10:02:34,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {16446#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16343#false} is VALID [2022-04-08 10:02:34,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {16450#(< 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; {16446#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:34,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {16454#(< 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; {16450#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:34,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {16458#(< 0 (mod (+ main_~z~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; {16454#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:34,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {16462#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {16458#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:34,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {16462#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16462#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:34,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {16469#(< 0 (mod (+ main_~y~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; {16462#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:34,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {16473#(< 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; {16469#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:34,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {16477#(< 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; {16473#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:34,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {16481#(< 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; {16477#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:34,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {16485#(< 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; {16481#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:34,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {16489#(< 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; {16485#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:34,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {16493#(< 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; {16489#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:34,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {16497#(< 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; {16493#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:34,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {16342#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16497#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:34,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {16342#true} call #t~ret9 := main(); {16342#true} is VALID [2022-04-08 10:02:34,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16342#true} {16342#true} #50#return; {16342#true} is VALID [2022-04-08 10:02:34,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {16342#true} assume true; {16342#true} is VALID [2022-04-08 10:02:34,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {16342#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); {16342#true} is VALID [2022-04-08 10:02:34,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {16342#true} call ULTIMATE.init(); {16342#true} is VALID [2022-04-08 10:02:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108229170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:34,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:34,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:02:34,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:34,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715560528] [2022-04-08 10:02:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715560528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:34,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:34,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:02:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902538235] [2022-04-08 10:02:34,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:34,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:34,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:34,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:34,689 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:02:34,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:02:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:02:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:02:34,689 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:35,592 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-08 10:02:35,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:02:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-08 10:02:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-08 10:02:35,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 53 transitions. [2022-04-08 10:02:35,657 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:02:35,658 INFO L225 Difference]: With dead ends: 58 [2022-04-08 10:02:35,658 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 10:02:35,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=454, Invalid=1802, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:02:35,660 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:35,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 82 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 10:02:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2022-04-08 10:02:35,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:35,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:35,776 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:35,776 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:35,777 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-08 10:02:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-08 10:02:35,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:35,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:35,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 53 states. [2022-04-08 10:02:35,777 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 53 states. [2022-04-08 10:02:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:35,778 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-08 10:02:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-08 10:02:35,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:35,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:35,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:35,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-08 10:02:35,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-08 10:02:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:35,779 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-08 10:02:35,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:35,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-08 10:02:35,925 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:02:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 10:02:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:02:35,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:35,926 INFO L499 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:35,957 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:02:36,141 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:02:36,141 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash -719242868, now seen corresponding path program 67 times [2022-04-08 10:02:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:36,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [290795573] [2022-04-08 10:02:36,144 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:36,144 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash -719242868, now seen corresponding path program 68 times [2022-04-08 10:02:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:36,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410088428] [2022-04-08 10:02:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:36,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {16866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {16848#true} is VALID [2022-04-08 10:02:36,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-08 10:02:36,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-08 10:02:36,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {16848#true} call ULTIMATE.init(); {16866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:36,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {16866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {16848#true} is VALID [2022-04-08 10:02:36,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-08 10:02:36,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-08 10:02:36,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {16848#true} call #t~ret9 := main(); {16848#true} is VALID [2022-04-08 10:02:36,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {16848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16853#(= main_~y~0 0)} is VALID [2022-04-08 10:02:36,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {16853#(= 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; {16854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:36,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {16854#(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; {16855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:36,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {16855#(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; {16856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:36,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {16856#(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; {16857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:36,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {16857#(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; {16858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:36,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {16858#(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; {16859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:36,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {16859#(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; {16860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:36,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {16860#(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; {16861#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:36,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {16861#(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; {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:36,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:36,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16863#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:36,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {16863#(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; {16864#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:36,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {16864#(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; {16865#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:36,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {16865#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16849#false} is VALID [2022-04-08 10:02:36,326 INFO L272 TraceCheckUtils]: 20: Hoare triple {16849#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16849#false} is VALID [2022-04-08 10:02:36,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {16849#false} ~cond := #in~cond; {16849#false} is VALID [2022-04-08 10:02:36,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {16849#false} assume 0 == ~cond; {16849#false} is VALID [2022-04-08 10:02:36,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {16849#false} assume !false; {16849#false} is VALID [2022-04-08 10:02:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:36,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:36,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410088428] [2022-04-08 10:02:36,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410088428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:36,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317027175] [2022-04-08 10:02:36,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:36,327 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:02:36,328 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:02:36,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:36,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:36,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:02:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:36,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:36,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {16848#true} call ULTIMATE.init(); {16848#true} is VALID [2022-04-08 10:02:36,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {16848#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); {16848#true} is VALID [2022-04-08 10:02:36,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-08 10:02:36,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-08 10:02:36,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {16848#true} call #t~ret9 := main(); {16848#true} is VALID [2022-04-08 10:02:36,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {16848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16853#(= main_~y~0 0)} is VALID [2022-04-08 10:02:36,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {16853#(= 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; {16854#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:36,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {16854#(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; {16855#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:36,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {16855#(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; {16856#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:36,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {16856#(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; {16857#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:36,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {16857#(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; {16858#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:36,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {16858#(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; {16859#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:36,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {16859#(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; {16860#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:36,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {16860#(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; {16861#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:36,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {16861#(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; {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:36,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:36,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {16862#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {16863#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:36,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {16863#(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; {16864#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:36,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {16864#(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; {16924#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:36,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {16924#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16849#false} is VALID [2022-04-08 10:02:36,621 INFO L272 TraceCheckUtils]: 20: Hoare triple {16849#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16849#false} is VALID [2022-04-08 10:02:36,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {16849#false} ~cond := #in~cond; {16849#false} is VALID [2022-04-08 10:02:36,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {16849#false} assume 0 == ~cond; {16849#false} is VALID [2022-04-08 10:02:36,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {16849#false} assume !false; {16849#false} is VALID [2022-04-08 10:02:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:36,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:36,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {16849#false} assume !false; {16849#false} is VALID [2022-04-08 10:02:36,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {16849#false} assume 0 == ~cond; {16849#false} is VALID [2022-04-08 10:02:36,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {16849#false} ~cond := #in~cond; {16849#false} is VALID [2022-04-08 10:02:36,959 INFO L272 TraceCheckUtils]: 20: Hoare triple {16849#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16849#false} is VALID [2022-04-08 10:02:36,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {16952#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16849#false} is VALID [2022-04-08 10:02:36,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {16956#(< 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; {16952#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:36,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {16960#(< 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; {16956#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:36,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {16964#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {16960#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:36,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {16964#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {16964#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:36,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {16971#(< 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; {16964#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:36,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {16975#(< 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; {16971#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:36,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {16979#(< 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; {16975#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:36,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {16983#(< 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; {16979#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:36,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {16987#(< 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; {16983#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:36,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {16991#(< 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; {16987#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:36,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {16995#(< 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; {16991#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:36,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {16999#(< 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; {16995#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:36,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {17003#(< 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; {16999#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:36,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {16848#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17003#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:36,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {16848#true} call #t~ret9 := main(); {16848#true} is VALID [2022-04-08 10:02:36,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16848#true} {16848#true} #50#return; {16848#true} is VALID [2022-04-08 10:02:36,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {16848#true} assume true; {16848#true} is VALID [2022-04-08 10:02:36,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {16848#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); {16848#true} is VALID [2022-04-08 10:02:36,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {16848#true} call ULTIMATE.init(); {16848#true} is VALID [2022-04-08 10:02:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:36,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317027175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:36,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:36,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:02:36,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:36,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [290795573] [2022-04-08 10:02:36,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [290795573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:36,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:36,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:02:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694974628] [2022-04-08 10:02:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:36,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:36,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:36,984 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:02:36,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:02:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:02:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:02:36,985 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:38,191 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-08 10:02:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:02:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 56 transitions. [2022-04-08 10:02:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 56 transitions. [2022-04-08 10:02:38,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 56 transitions. [2022-04-08 10:02:38,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:38,222 INFO L225 Difference]: With dead ends: 62 [2022-04-08 10:02:38,222 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 10:02:38,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:02:38,223 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:38,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 91 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:02:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 10:02:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-04-08 10:02:38,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:38,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:38,322 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:38,326 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:38,327 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 10:02:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 10:02:38,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:38,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:38,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 57 states. [2022-04-08 10:02:38,328 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 57 states. [2022-04-08 10:02:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:38,329 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 10:02:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 10:02:38,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:38,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:38,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:38,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-08 10:02:38,331 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-08 10:02:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:38,331 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-08 10:02:38,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:38,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-08 10:02:38,476 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:02:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 10:02:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:02:38,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:38,476 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:38,496 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:02:38,677 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:02:38,677 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:38,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1303710453, now seen corresponding path program 69 times [2022-04-08 10:02:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:38,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145201987] [2022-04-08 10:02:38,680 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:38,680 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1303710453, now seen corresponding path program 70 times [2022-04-08 10:02:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531078876] [2022-04-08 10:02:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:38,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:38,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {17384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {17366#true} is VALID [2022-04-08 10:02:38,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-08 10:02:38,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-08 10:02:38,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {17366#true} call ULTIMATE.init(); {17384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:38,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {17384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {17366#true} is VALID [2022-04-08 10:02:38,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-08 10:02:38,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-08 10:02:38,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {17366#true} call #t~ret9 := main(); {17366#true} is VALID [2022-04-08 10:02:38,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {17366#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17371#(= main_~y~0 0)} is VALID [2022-04-08 10:02:38,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {17371#(= 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; {17372#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:38,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {17372#(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; {17373#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:38,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {17373#(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; {17374#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:38,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {17374#(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; {17375#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:38,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {17375#(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; {17376#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:38,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {17376#(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; {17377#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:38,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {17377#(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; {17378#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:38,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {17378#(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; {17379#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:38,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {17379#(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; {17380#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:38,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {17380#(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; {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:38,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:38,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {17382#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:02:38,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {17382#(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; {17383#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:38,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {17383#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17367#false} is VALID [2022-04-08 10:02:38,835 INFO L272 TraceCheckUtils]: 20: Hoare triple {17367#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17367#false} is VALID [2022-04-08 10:02:38,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {17367#false} ~cond := #in~cond; {17367#false} is VALID [2022-04-08 10:02:38,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {17367#false} assume 0 == ~cond; {17367#false} is VALID [2022-04-08 10:02:38,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {17367#false} assume !false; {17367#false} is VALID [2022-04-08 10:02:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:38,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:38,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531078876] [2022-04-08 10:02:38,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531078876] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:38,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476804110] [2022-04-08 10:02:38,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:38,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:38,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:38,837 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:02:38,838 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:02:38,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:38,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:38,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:02:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:38,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:39,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {17366#true} call ULTIMATE.init(); {17366#true} is VALID [2022-04-08 10:02:39,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {17366#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); {17366#true} is VALID [2022-04-08 10:02:39,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-08 10:02:39,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-08 10:02:39,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {17366#true} call #t~ret9 := main(); {17366#true} is VALID [2022-04-08 10:02:39,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {17366#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17371#(= main_~y~0 0)} is VALID [2022-04-08 10:02:39,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {17371#(= 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; {17372#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:39,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {17372#(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; {17373#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:39,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {17373#(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; {17374#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:39,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {17374#(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; {17375#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:39,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {17375#(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; {17376#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:39,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {17376#(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; {17377#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:39,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {17377#(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; {17378#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:39,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {17378#(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; {17379#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:39,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {17379#(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; {17380#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:39,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {17380#(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; {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:39,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:39,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {17381#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {17382#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:02:39,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {17382#(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; {17442#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:39,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {17442#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {17367#false} is VALID [2022-04-08 10:02:39,085 INFO L272 TraceCheckUtils]: 20: Hoare triple {17367#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17367#false} is VALID [2022-04-08 10:02:39,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {17367#false} ~cond := #in~cond; {17367#false} is VALID [2022-04-08 10:02:39,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {17367#false} assume 0 == ~cond; {17367#false} is VALID [2022-04-08 10:02:39,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {17367#false} assume !false; {17367#false} is VALID [2022-04-08 10:02:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:39,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:39,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {17367#false} assume !false; {17367#false} is VALID [2022-04-08 10:02:39,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {17367#false} assume 0 == ~cond; {17367#false} is VALID [2022-04-08 10:02:39,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {17367#false} ~cond := #in~cond; {17367#false} is VALID [2022-04-08 10:02:39,456 INFO L272 TraceCheckUtils]: 20: Hoare triple {17367#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17367#false} is VALID [2022-04-08 10:02:39,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {17470#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17367#false} is VALID [2022-04-08 10:02:39,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {17474#(< 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; {17470#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:39,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {17478#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {17474#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:39,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {17478#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17478#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:39,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {17485#(< 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; {17478#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:39,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {17489#(< 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; {17485#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:39,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {17493#(< 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; {17489#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:39,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {17497#(< 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; {17493#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:39,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {17501#(< 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; {17497#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:39,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {17505#(< 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; {17501#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:39,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {17509#(< 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; {17505#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:39,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {17513#(< 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; {17509#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:39,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {17517#(< 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; {17513#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:39,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {17521#(< 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; {17517#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:02:39,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {17366#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17521#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:02:39,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {17366#true} call #t~ret9 := main(); {17366#true} is VALID [2022-04-08 10:02:39,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17366#true} {17366#true} #50#return; {17366#true} is VALID [2022-04-08 10:02:39,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {17366#true} assume true; {17366#true} is VALID [2022-04-08 10:02:39,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {17366#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); {17366#true} is VALID [2022-04-08 10:02:39,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {17366#true} call ULTIMATE.init(); {17366#true} is VALID [2022-04-08 10:02:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:39,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476804110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:39,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:39,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:02:39,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:39,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145201987] [2022-04-08 10:02:39,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145201987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:39,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:39,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:02:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960463243] [2022-04-08 10:02:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:39,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:39,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:39,477 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:02:39,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:02:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:02:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:02:39,478 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:40,969 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-08 10:02:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:02:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-08 10:02:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 59 transitions. [2022-04-08 10:02:40,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 59 transitions. [2022-04-08 10:02:41,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:41,017 INFO L225 Difference]: With dead ends: 65 [2022-04-08 10:02:41,018 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 10:02:41,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:02:41,018 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:41,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 91 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:02:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 10:02:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-04-08 10:02:41,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:41,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:41,172 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:41,172 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:41,173 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 10:02:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 10:02:41,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:41,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:41,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 60 states. [2022-04-08 10:02:41,174 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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 60 states. [2022-04-08 10:02:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:41,174 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-08 10:02:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-08 10:02:41,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:41,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:41,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:41,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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:02:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-04-08 10:02:41,175 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2022-04-08 10:02:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:41,175 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-04-08 10:02:41,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:41,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 42 transitions. [2022-04-08 10:02:41,314 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:02:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-04-08 10:02:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:02:41,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:41,314 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:41,330 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:02:41,527 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:02:41,527 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 894193068, now seen corresponding path program 21 times [2022-04-08 10:02:41,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:41,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679572177] [2022-04-08 10:02:41,529 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:41,530 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash 894193068, now seen corresponding path program 22 times [2022-04-08 10:02:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:41,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681734870] [2022-04-08 10:02:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:41,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {17910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {17892#true} is VALID [2022-04-08 10:02:41,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 10:02:41,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-08 10:02:41,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:41,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {17910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {17892#true} is VALID [2022-04-08 10:02:41,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 10:02:41,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-08 10:02:41,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret9 := main(); {17892#true} is VALID [2022-04-08 10:02:41,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17897#(= main_~y~0 0)} is VALID [2022-04-08 10:02:41,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(= 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; {17898#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:41,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {17898#(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; {17899#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:41,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {17899#(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; {17900#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:41,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {17900#(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; {17901#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:41,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {17901#(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; {17902#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:41,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {17902#(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; {17903#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:41,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {17903#(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; {17904#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:41,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {17904#(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; {17905#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:41,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {17905#(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; {17906#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:41,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {17906#(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; {17907#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:41,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {17907#(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; {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:41,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:41,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {17909#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:02:41,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {17909#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17893#false} is VALID [2022-04-08 10:02:41,726 INFO L272 TraceCheckUtils]: 20: Hoare triple {17893#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17893#false} is VALID [2022-04-08 10:02:41,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 10:02:41,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 10:02:41,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 10:02:41,726 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:02:41,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:41,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681734870] [2022-04-08 10:02:41,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681734870] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:41,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845960025] [2022-04-08 10:02:41,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:41,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:41,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:41,727 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:02:41,729 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:02:41,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:41,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:41,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:02:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:41,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:41,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-08 10:02:41,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#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); {17892#true} is VALID [2022-04-08 10:02:41,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 10:02:41,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-08 10:02:41,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret9 := main(); {17892#true} is VALID [2022-04-08 10:02:41,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17897#(= main_~y~0 0)} is VALID [2022-04-08 10:02:41,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {17897#(= 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; {17898#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:41,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {17898#(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; {17899#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:41,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {17899#(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; {17900#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:41,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {17900#(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; {17901#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:41,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {17901#(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; {17902#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:41,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {17902#(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; {17903#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:41,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {17903#(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; {17904#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:41,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {17904#(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; {17905#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:41,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {17905#(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; {17906#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:41,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {17906#(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; {17907#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:41,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {17907#(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; {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:41,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:41,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {17908#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {17968#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:02:41,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {17968#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17893#false} is VALID [2022-04-08 10:02:41,945 INFO L272 TraceCheckUtils]: 20: Hoare triple {17893#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17893#false} is VALID [2022-04-08 10:02:41,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 10:02:41,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 10:02:41,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 10:02:41,945 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:02:41,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:42,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {17893#false} assume !false; {17893#false} is VALID [2022-04-08 10:02:42,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {17893#false} assume 0 == ~cond; {17893#false} is VALID [2022-04-08 10:02:42,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {17893#false} ~cond := #in~cond; {17893#false} is VALID [2022-04-08 10:02:42,165 INFO L272 TraceCheckUtils]: 20: Hoare triple {17893#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17893#false} is VALID [2022-04-08 10:02:42,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {17996#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17893#false} is VALID [2022-04-08 10:02:42,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {18000#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {17996#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:42,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {18000#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18000#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:42,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {18007#(< 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; {18000#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:42,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {18011#(< 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; {18007#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:42,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {18015#(< 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; {18011#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:42,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {18019#(< 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; {18015#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:42,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {18023#(< 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; {18019#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:42,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {18027#(< 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; {18023#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:42,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {18031#(< 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; {18027#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:42,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {18035#(< 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; {18031#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:42,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {18039#(< 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; {18035#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:02:42,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {18043#(< 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; {18039#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:02:42,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {18047#(< 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; {18043#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:02:42,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {17892#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18047#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:02:42,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {17892#true} call #t~ret9 := main(); {17892#true} is VALID [2022-04-08 10:02:42,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17892#true} {17892#true} #50#return; {17892#true} is VALID [2022-04-08 10:02:42,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {17892#true} assume true; {17892#true} is VALID [2022-04-08 10:02:42,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {17892#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); {17892#true} is VALID [2022-04-08 10:02:42,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {17892#true} call ULTIMATE.init(); {17892#true} is VALID [2022-04-08 10:02:42,172 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:02:42,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845960025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:42,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:42,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:02:42,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:42,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679572177] [2022-04-08 10:02:42,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679572177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:42,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:42,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:02:42,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375097888] [2022-04-08 10:02:42,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:42,173 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:42,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:42,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:42,184 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:02:42,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:02:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:02:42,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:02:42,185 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:43,252 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-08 10:02:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:02:43,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-08 10:02:43,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 63 transitions. [2022-04-08 10:02:43,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 63 transitions. [2022-04-08 10:02:43,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:43,287 INFO L225 Difference]: With dead ends: 70 [2022-04-08 10:02:43,287 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 10:02:43,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 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:02:43,288 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:43,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 99 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:02:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 10:02:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2022-04-08 10:02:43,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:43,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:43,395 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:43,395 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:43,401 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 10:02:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 10:02:43,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:43,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:43,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 10:02:43,402 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 10:02:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:43,402 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 10:02:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 10:02:43,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:43,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:43,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:43,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-08 10:02:43,415 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-04-08 10:02:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:43,415 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-08 10:02:43,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:02:43,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 45 transitions. [2022-04-08 10:02:43,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 10:02:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:02:43,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:43,546 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:43,562 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:02:43,761 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:02:43,761 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash 690452087, now seen corresponding path program 71 times [2022-04-08 10:02:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:43,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014281346] [2022-04-08 10:02:43,764 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:43,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 690452087, now seen corresponding path program 72 times [2022-04-08 10:02:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:43,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414763039] [2022-04-08 10:02:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:44,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {18461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {18440#true} is VALID [2022-04-08 10:02:44,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-08 10:02:44,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-08 10:02:44,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {18440#true} call ULTIMATE.init(); {18461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:44,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {18461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {18440#true} is VALID [2022-04-08 10:02:44,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-08 10:02:44,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-08 10:02:44,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {18440#true} call #t~ret9 := main(); {18440#true} is VALID [2022-04-08 10:02:44,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {18440#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:44,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18446#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:02:44,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {18446#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {18447#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:02:44,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {18447#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~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; {18448#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:02:44,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {18448#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= 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; {18449#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:02:44,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {18449#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18450#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:02:44,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {18450#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= 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; {18451#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:02:44,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {18451#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {18452#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:02:44,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {18452#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {18452#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:02:44,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {18452#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 6)) (<= (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {18453#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:02:44,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {18453#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~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; {18454#(and (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:02:44,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {18454#(and (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 2) main_~x~0) (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 2 (* (div main_~n~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; {18455#(and (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:02:44,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {18455#(and (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~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; {18456#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:02:44,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {18456#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~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; {18457#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:02:44,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {18457#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~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; {18458#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:02:44,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {18458#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {18458#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:02:44,328 INFO L272 TraceCheckUtils]: 21: Hoare triple {18458#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18459#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:02:44,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {18459#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18460#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:02:44,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {18460#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18441#false} is VALID [2022-04-08 10:02:44,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {18441#false} assume !false; {18441#false} is VALID [2022-04-08 10:02:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:44,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414763039] [2022-04-08 10:02:44,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414763039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:44,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384874601] [2022-04-08 10:02:44,329 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:44,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:44,330 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:02:44,331 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:02:44,375 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:02:44,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:44,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:02:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:44,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:44,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {18440#true} call ULTIMATE.init(); {18440#true} is VALID [2022-04-08 10:02:44,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {18440#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); {18440#true} is VALID [2022-04-08 10:02:44,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-08 10:02:44,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-08 10:02:44,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {18440#true} call #t~ret9 := main(); {18440#true} is VALID [2022-04-08 10:02:44,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {18440#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:44,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18483#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:02:44,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {18483#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18487#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:02:44,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {18487#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18491#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:02:44,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {18491#(= (+ (- 2) main_~n~0) (+ main_~x~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; {18495#(= (+ (- 2) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:02:44,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {18495#(= (+ (- 2) main_~n~0) (+ main_~x~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; {18499#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} is VALID [2022-04-08 10:02:44,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {18499#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18503#(= (+ (- 2) main_~n~0) (+ main_~x~0 4))} is VALID [2022-04-08 10:02:44,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {18503#(= (+ (- 2) main_~n~0) (+ main_~x~0 4))} assume !(~x~0 % 4294967296 > 0); {18503#(= (+ (- 2) main_~n~0) (+ main_~x~0 4))} is VALID [2022-04-08 10:02:44,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {18503#(= (+ (- 2) main_~n~0) (+ main_~x~0 4))} ~z~0 := ~y~0; {18503#(= (+ (- 2) main_~n~0) (+ main_~x~0 4))} is VALID [2022-04-08 10:02:44,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {18503#(= (+ (- 2) main_~n~0) (+ main_~x~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; {18499#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} is VALID [2022-04-08 10:02:44,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {18499#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18495#(= (+ (- 2) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:02:44,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {18495#(= (+ (- 2) main_~n~0) (+ main_~x~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; {18491#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:02:44,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {18491#(= (+ (- 2) main_~n~0) (+ main_~x~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; {18487#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:02:44,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {18487#(= (+ main_~x~0 1) (+ (- 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; {18483#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:02:44,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {18483#(= (+ 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; {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:44,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:02:44,656 INFO L272 TraceCheckUtils]: 21: Hoare triple {18445#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18534#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:02:44,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {18534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:02:44,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {18538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18441#false} is VALID [2022-04-08 10:02:44,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {18441#false} assume !false; {18441#false} is VALID [2022-04-08 10:02:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:44,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:44,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {18441#false} assume !false; {18441#false} is VALID [2022-04-08 10:02:44,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {18538#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18441#false} is VALID [2022-04-08 10:02:44,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {18534#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18538#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:02:44,964 INFO L272 TraceCheckUtils]: 21: Hoare triple {18554#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18534#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:02:44,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {18554#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18554#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:02:44,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {18561#(= (mod main_~n~0 4294967296) (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; {18554#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:02:44,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {18565#(= (mod main_~n~0 4294967296) (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; {18561#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:02:44,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {18569#(= (mod (+ main_~x~0 3) 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; {18565#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:02:44,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {18573#(= (mod main_~n~0 4294967296) (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; {18569#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:02:44,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {18577#(= (mod main_~n~0 4294967296) (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; {18573#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:02:44,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {18581#(= (mod main_~n~0 4294967296) (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; {18577#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:02:44,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {18581#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} ~z~0 := ~y~0; {18581#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:02:44,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {18581#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18581#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:02:44,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {18577#(= (mod main_~n~0 4294967296) (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; {18581#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:02:44,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {18573#(= (mod main_~n~0 4294967296) (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; {18577#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:02:44,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {18569#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~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; {18573#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:02:44,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {18565#(= (mod main_~n~0 4294967296) (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; {18569#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:02:44,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {18561#(= (mod main_~n~0 4294967296) (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; {18565#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:02:44,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {18554#(= (mod main_~n~0 4294967296) (mod 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; {18561#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:02:44,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {18440#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18554#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:02:44,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {18440#true} call #t~ret9 := main(); {18440#true} is VALID [2022-04-08 10:02:44,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18440#true} {18440#true} #50#return; {18440#true} is VALID [2022-04-08 10:02:44,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {18440#true} assume true; {18440#true} is VALID [2022-04-08 10:02:44,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {18440#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); {18440#true} is VALID [2022-04-08 10:02:44,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {18440#true} call ULTIMATE.init(); {18440#true} is VALID [2022-04-08 10:02:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384874601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:44,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:44,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 34 [2022-04-08 10:02:44,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014281346] [2022-04-08 10:02:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014281346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:44,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:44,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:02:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981695517] [2022-04-08 10:02:44,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:02:44,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:44,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:45,002 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:02:45,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:02:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:45,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:02:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:02:45,003 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:46,735 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-08 10:02:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:02:46,736 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-08 10:02:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2022-04-08 10:02:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2022-04-08 10:02:46,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 36 transitions. [2022-04-08 10:02:46,768 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:02:46,771 INFO L225 Difference]: With dead ends: 49 [2022-04-08 10:02:46,771 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 10:02:46,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=2146, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:02:46,772 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:46,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:02:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 10:02:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-04-08 10:02:46,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:46,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,922 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,923 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:46,925 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 10:02:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 10:02:46,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:46,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:46,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-08 10:02:46,925 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-08 10:02:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:46,926 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 10:02:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 10:02:46,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:46,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:46,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:46,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 10:02:46,926 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-08 10:02:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:46,926 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 10:02:46,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:46,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 10:02:47,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:02:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:02:47,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:47,102 INFO L499 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:47,118 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:02:47,315 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:02:47,315 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1678157194, now seen corresponding path program 73 times [2022-04-08 10:02:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:47,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1467050324] [2022-04-08 10:02:47,319 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:47,319 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1678157194, now seen corresponding path program 74 times [2022-04-08 10:02:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923861521] [2022-04-08 10:02:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:47,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:47,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {18939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {18920#true} is VALID [2022-04-08 10:02:47,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-08 10:02:47,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-08 10:02:47,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {18920#true} call ULTIMATE.init(); {18939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:47,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {18939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {18920#true} is VALID [2022-04-08 10:02:47,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-08 10:02:47,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-08 10:02:47,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {18920#true} call #t~ret9 := main(); {18920#true} is VALID [2022-04-08 10:02:47,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {18920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18925#(= main_~y~0 0)} is VALID [2022-04-08 10:02:47,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {18925#(= 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; {18926#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:47,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {18926#(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; {18927#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:47,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {18927#(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; {18928#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:47,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {18928#(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; {18929#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:47,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {18929#(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; {18930#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:47,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {18930#(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; {18931#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:47,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {18931#(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; {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:47,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:47,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {18933#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:47,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {18933#(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; {18934#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:47,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {18934#(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; {18935#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:47,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {18935#(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; {18936#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:47,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {18936#(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; {18937#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:47,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {18937#(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; {18938#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:47,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {18938#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18921#false} is VALID [2022-04-08 10:02:47,540 INFO L272 TraceCheckUtils]: 21: Hoare triple {18921#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18921#false} is VALID [2022-04-08 10:02:47,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {18921#false} ~cond := #in~cond; {18921#false} is VALID [2022-04-08 10:02:47,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {18921#false} assume 0 == ~cond; {18921#false} is VALID [2022-04-08 10:02:47,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {18921#false} assume !false; {18921#false} is VALID [2022-04-08 10:02:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:47,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923861521] [2022-04-08 10:02:47,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923861521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:47,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527957286] [2022-04-08 10:02:47,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:47,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:47,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:47,541 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:02:47,542 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:02:47,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:47,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:47,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:02:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:47,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:47,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {18920#true} call ULTIMATE.init(); {18920#true} is VALID [2022-04-08 10:02:47,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {18920#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); {18920#true} is VALID [2022-04-08 10:02:47,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-08 10:02:47,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-08 10:02:47,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {18920#true} call #t~ret9 := main(); {18920#true} is VALID [2022-04-08 10:02:47,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {18920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18925#(= main_~y~0 0)} is VALID [2022-04-08 10:02:47,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {18925#(= 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; {18926#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:47,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {18926#(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; {18927#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:47,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {18927#(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; {18928#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:47,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {18928#(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; {18929#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:47,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {18929#(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; {18930#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:47,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {18930#(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; {18931#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:47,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {18931#(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; {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:47,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:47,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {18932#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {18933#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:47,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {18933#(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; {18934#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:47,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {18934#(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; {18935#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:47,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {18935#(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; {18936#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:47,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {18936#(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; {18937#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:02:47,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {18937#(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; {19000#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:02:47,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {19000#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18921#false} is VALID [2022-04-08 10:02:47,865 INFO L272 TraceCheckUtils]: 21: Hoare triple {18921#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18921#false} is VALID [2022-04-08 10:02:47,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {18921#false} ~cond := #in~cond; {18921#false} is VALID [2022-04-08 10:02:47,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {18921#false} assume 0 == ~cond; {18921#false} is VALID [2022-04-08 10:02:47,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {18921#false} assume !false; {18921#false} is VALID [2022-04-08 10:02:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:47,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:48,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {18921#false} assume !false; {18921#false} is VALID [2022-04-08 10:02:48,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {18921#false} assume 0 == ~cond; {18921#false} is VALID [2022-04-08 10:02:48,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {18921#false} ~cond := #in~cond; {18921#false} is VALID [2022-04-08 10:02:48,196 INFO L272 TraceCheckUtils]: 21: Hoare triple {18921#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18921#false} is VALID [2022-04-08 10:02:48,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {19028#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18921#false} is VALID [2022-04-08 10:02:48,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {19032#(< 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; {19028#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:48,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {19036#(< 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; {19032#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:48,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {19040#(< 0 (mod (+ main_~z~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; {19036#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:48,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {19044#(< 0 (mod (+ 4294967292 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; {19040#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:48,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {19048#(< 0 (mod (+ 4294967291 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; {19044#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:48,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {19052#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {19048#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:48,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {19052#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {19052#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:48,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {19059#(< 0 (mod (+ 4294967292 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; {19052#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:48,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {19063#(< 0 (mod (+ main_~y~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; {19059#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:48,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {19067#(< 0 (mod (+ main_~y~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; {19063#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:48,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {19071#(< 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; {19067#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:48,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {19075#(< 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; {19071#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:48,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {19079#(< 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; {19075#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:48,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {19083#(< 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; {19079#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:48,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {18920#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19083#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:48,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {18920#true} call #t~ret9 := main(); {18920#true} is VALID [2022-04-08 10:02:48,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18920#true} {18920#true} #50#return; {18920#true} is VALID [2022-04-08 10:02:48,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {18920#true} assume true; {18920#true} is VALID [2022-04-08 10:02:48,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {18920#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); {18920#true} is VALID [2022-04-08 10:02:48,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {18920#true} call ULTIMATE.init(); {18920#true} is VALID [2022-04-08 10:02:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:48,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527957286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:48,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:48,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:02:48,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:48,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1467050324] [2022-04-08 10:02:48,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1467050324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:48,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:48,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:02:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305678362] [2022-04-08 10:02:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:48,207 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:48,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:48,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:48,223 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:02:48,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:02:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:02:48,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:02:48,224 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:49,286 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-08 10:02:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:02:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-08 10:02:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2022-04-08 10:02:49,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 49 transitions. [2022-04-08 10:02:49,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:49,315 INFO L225 Difference]: With dead ends: 58 [2022-04-08 10:02:49,315 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 10:02:49,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=2077, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 10:02:49,316 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:49,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 74 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:02:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 10:02:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-04-08 10:02:49,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:49,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:49,475 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:49,475 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:49,476 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-08 10:02:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-08 10:02:49,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:49,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:49,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 10:02:49,476 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-08 10:02:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:49,480 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-08 10:02:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-08 10:02:49,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:49,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:49,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:49,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 10:02:49,481 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-08 10:02:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:49,482 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 10:02:49,482 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:49,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 10:02:49,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:02:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:02:49,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:49,699 INFO L499 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:49,725 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:02:49,915 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:02:49,915 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1754563945, now seen corresponding path program 75 times [2022-04-08 10:02:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015253496] [2022-04-08 10:02:49,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:49,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1754563945, now seen corresponding path program 76 times [2022-04-08 10:02:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:49,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403322555] [2022-04-08 10:02:49,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:50,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:50,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {19461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {19442#true} is VALID [2022-04-08 10:02:50,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-08 10:02:50,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-08 10:02:50,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {19442#true} call ULTIMATE.init(); {19461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:50,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {19461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {19442#true} is VALID [2022-04-08 10:02:50,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-08 10:02:50,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-08 10:02:50,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {19442#true} call #t~ret9 := main(); {19442#true} is VALID [2022-04-08 10:02:50,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {19442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19447#(= main_~y~0 0)} is VALID [2022-04-08 10:02:50,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {19447#(= 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; {19448#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:50,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {19448#(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; {19449#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:50,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {19449#(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; {19450#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:50,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {19450#(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; {19451#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:50,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {19451#(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; {19452#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:50,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {19452#(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; {19453#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:50,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {19453#(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; {19454#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:50,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {19454#(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; {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:50,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:50,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {19456#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:50,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {19456#(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; {19457#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:50,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {19457#(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; {19458#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:50,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {19458#(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; {19459#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:50,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {19459#(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; {19460#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:50,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {19460#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {19443#false} is VALID [2022-04-08 10:02:50,118 INFO L272 TraceCheckUtils]: 21: Hoare triple {19443#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19443#false} is VALID [2022-04-08 10:02:50,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {19443#false} ~cond := #in~cond; {19443#false} is VALID [2022-04-08 10:02:50,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {19443#false} assume 0 == ~cond; {19443#false} is VALID [2022-04-08 10:02:50,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#false} assume !false; {19443#false} is VALID [2022-04-08 10:02:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:50,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403322555] [2022-04-08 10:02:50,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403322555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:50,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904981564] [2022-04-08 10:02:50,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:50,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:50,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:50,129 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:02:50,130 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:02:50,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:50,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:50,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:02:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:50,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:50,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {19442#true} call ULTIMATE.init(); {19442#true} is VALID [2022-04-08 10:02:50,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {19442#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); {19442#true} is VALID [2022-04-08 10:02:50,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-08 10:02:50,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-08 10:02:50,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {19442#true} call #t~ret9 := main(); {19442#true} is VALID [2022-04-08 10:02:50,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {19442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19447#(= main_~y~0 0)} is VALID [2022-04-08 10:02:50,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {19447#(= 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; {19448#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:50,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {19448#(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; {19449#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:50,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {19449#(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; {19450#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:50,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {19450#(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; {19451#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:50,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {19451#(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; {19452#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:50,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {19452#(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; {19453#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:50,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {19453#(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; {19454#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:50,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {19454#(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; {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:50,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:50,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {19455#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {19456#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:50,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {19456#(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; {19457#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:50,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {19457#(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; {19458#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:50,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {19458#(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; {19459#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:02:50,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {19459#(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; {19522#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:02:50,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {19522#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {19443#false} is VALID [2022-04-08 10:02:50,439 INFO L272 TraceCheckUtils]: 21: Hoare triple {19443#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19443#false} is VALID [2022-04-08 10:02:50,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {19443#false} ~cond := #in~cond; {19443#false} is VALID [2022-04-08 10:02:50,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {19443#false} assume 0 == ~cond; {19443#false} is VALID [2022-04-08 10:02:50,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#false} assume !false; {19443#false} is VALID [2022-04-08 10:02:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:50,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:50,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#false} assume !false; {19443#false} is VALID [2022-04-08 10:02:50,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {19443#false} assume 0 == ~cond; {19443#false} is VALID [2022-04-08 10:02:50,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {19443#false} ~cond := #in~cond; {19443#false} is VALID [2022-04-08 10:02:50,785 INFO L272 TraceCheckUtils]: 21: Hoare triple {19443#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19443#false} is VALID [2022-04-08 10:02:50,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {19550#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19443#false} is VALID [2022-04-08 10:02:50,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {19554#(< 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; {19550#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:50,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {19558#(< 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; {19554#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:50,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {19562#(< 0 (mod (+ main_~z~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; {19558#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:50,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {19566#(< 0 (mod (+ 4294967292 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; {19562#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:50,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {19570#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {19566#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:02:50,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {19570#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {19570#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:50,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {19577#(< 0 (mod (+ main_~y~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; {19570#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:50,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {19581#(< 0 (mod (+ main_~y~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; {19577#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:50,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {19585#(< 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; {19581#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:50,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {19589#(< 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; {19585#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:50,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {19593#(< 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; {19589#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:50,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {19597#(< 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; {19593#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:50,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {19601#(< 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; {19597#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:50,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {19605#(< 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; {19601#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:50,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {19442#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19605#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:50,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {19442#true} call #t~ret9 := main(); {19442#true} is VALID [2022-04-08 10:02:50,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19442#true} {19442#true} #50#return; {19442#true} is VALID [2022-04-08 10:02:50,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {19442#true} assume true; {19442#true} is VALID [2022-04-08 10:02:50,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {19442#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); {19442#true} is VALID [2022-04-08 10:02:50,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {19442#true} call ULTIMATE.init(); {19442#true} is VALID [2022-04-08 10:02:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:50,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904981564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:50,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:50,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:02:50,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:50,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015253496] [2022-04-08 10:02:50,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015253496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:50,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:50,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:02:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251992020] [2022-04-08 10:02:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:50,794 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:50,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:50,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:50,831 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:02:50,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:02:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:02:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:02:50,832 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:51,933 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-08 10:02:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:02:51,933 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 56 transitions. [2022-04-08 10:02:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 56 transitions. [2022-04-08 10:02:51,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 56 transitions. [2022-04-08 10:02:51,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:51,963 INFO L225 Difference]: With dead ends: 64 [2022-04-08 10:02:51,963 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 10:02:51,964 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:02:51,965 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:51,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 77 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:02:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 10:02:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-04-08 10:02:52,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:52,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:52,099 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:52,099 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:52,099 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 10:02:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 10:02:52,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:52,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:52,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 10:02:52,100 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-08 10:02:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:52,100 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 10:02:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 10:02:52,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:52,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:52,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:52,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 10:02:52,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-08 10:02:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:52,101 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 10:02:52,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:52,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 10:02:52,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:02:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:02:52,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:52,278 INFO L499 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:52,310 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:02:52,491 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:02:52,491 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash -787197354, now seen corresponding path program 77 times [2022-04-08 10:02:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:52,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1549659942] [2022-04-08 10:02:52,494 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:52,494 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash -787197354, now seen corresponding path program 78 times [2022-04-08 10:02:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:52,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185943320] [2022-04-08 10:02:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:52,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {20011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {19992#true} is VALID [2022-04-08 10:02:52,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-08 10:02:52,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-08 10:02:52,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {19992#true} call ULTIMATE.init(); {20011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:52,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {20011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {19992#true} is VALID [2022-04-08 10:02:52,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-08 10:02:52,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-08 10:02:52,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {19992#true} call #t~ret9 := main(); {19992#true} is VALID [2022-04-08 10:02:52,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {19992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19997#(= main_~y~0 0)} is VALID [2022-04-08 10:02:52,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {19997#(= 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; {19998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:52,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {19998#(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; {19999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:52,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {19999#(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; {20000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:52,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {20000#(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; {20001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:52,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {20001#(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; {20002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:52,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {20002#(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; {20003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:52,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {20003#(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; {20004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:52,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {20004#(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; {20005#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:52,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {20005#(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; {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:52,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:52,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {20007#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:52,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {20007#(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; {20008#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:52,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {20008#(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; {20009#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:52,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {20009#(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; {20010#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:52,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {20010#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19993#false} is VALID [2022-04-08 10:02:52,690 INFO L272 TraceCheckUtils]: 21: Hoare triple {19993#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19993#false} is VALID [2022-04-08 10:02:52,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {19993#false} ~cond := #in~cond; {19993#false} is VALID [2022-04-08 10:02:52,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {19993#false} assume 0 == ~cond; {19993#false} is VALID [2022-04-08 10:02:52,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {19993#false} assume !false; {19993#false} is VALID [2022-04-08 10:02:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:52,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185943320] [2022-04-08 10:02:52,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185943320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:52,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881011839] [2022-04-08 10:02:52,691 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:02:52,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:52,692 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:02:52,693 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:02:52,755 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:02:52,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:52,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:02:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:52,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:53,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {19992#true} call ULTIMATE.init(); {19992#true} is VALID [2022-04-08 10:02:53,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {19992#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); {19992#true} is VALID [2022-04-08 10:02:53,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-08 10:02:53,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-08 10:02:53,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {19992#true} call #t~ret9 := main(); {19992#true} is VALID [2022-04-08 10:02:53,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {19992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19997#(= main_~y~0 0)} is VALID [2022-04-08 10:02:53,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {19997#(= 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; {19998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:53,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {19998#(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; {19999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:53,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {19999#(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; {20000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:53,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {20000#(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; {20001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:53,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {20001#(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; {20002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:53,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {20002#(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; {20003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:53,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {20003#(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; {20004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:53,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {20004#(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; {20005#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:53,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {20005#(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; {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:53,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:53,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {20006#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {20007#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:53,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {20007#(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; {20008#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:53,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {20008#(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; {20009#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:02:53,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {20009#(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; {20072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:02:53,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {20072#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19993#false} is VALID [2022-04-08 10:02:53,043 INFO L272 TraceCheckUtils]: 21: Hoare triple {19993#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19993#false} is VALID [2022-04-08 10:02:53,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {19993#false} ~cond := #in~cond; {19993#false} is VALID [2022-04-08 10:02:53,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {19993#false} assume 0 == ~cond; {19993#false} is VALID [2022-04-08 10:02:53,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {19993#false} assume !false; {19993#false} is VALID [2022-04-08 10:02:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:53,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:53,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {19993#false} assume !false; {19993#false} is VALID [2022-04-08 10:02:53,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {19993#false} assume 0 == ~cond; {19993#false} is VALID [2022-04-08 10:02:53,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {19993#false} ~cond := #in~cond; {19993#false} is VALID [2022-04-08 10:02:53,406 INFO L272 TraceCheckUtils]: 21: Hoare triple {19993#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19993#false} is VALID [2022-04-08 10:02:53,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {20100#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {19993#false} is VALID [2022-04-08 10:02:53,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {20104#(< 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; {20100#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:53,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {20108#(< 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; {20104#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:53,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {20112#(< 0 (mod (+ main_~z~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; {20108#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:53,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {20116#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {20112#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:53,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {20116#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20116#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:53,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {20123#(< 0 (mod (+ main_~y~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; {20116#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:02:53,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {20127#(< 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; {20123#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:53,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {20131#(< 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; {20127#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:53,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {20135#(< 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; {20131#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:53,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {20139#(< 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; {20135#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:53,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {20143#(< 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; {20139#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:53,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {20147#(< 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; {20143#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:53,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {20151#(< 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; {20147#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:53,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {20155#(< 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; {20151#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:53,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {19992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20155#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:53,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {19992#true} call #t~ret9 := main(); {19992#true} is VALID [2022-04-08 10:02:53,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19992#true} {19992#true} #50#return; {19992#true} is VALID [2022-04-08 10:02:53,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {19992#true} assume true; {19992#true} is VALID [2022-04-08 10:02:53,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {19992#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); {19992#true} is VALID [2022-04-08 10:02:53,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {19992#true} call ULTIMATE.init(); {19992#true} is VALID [2022-04-08 10:02:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:53,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881011839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:53,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:53,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:02:53,418 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:53,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1549659942] [2022-04-08 10:02:53,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1549659942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:53,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:53,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:02:53,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194442955] [2022-04-08 10:02:53,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:53,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:53,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:53,435 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:02:53,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:02:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:02:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:02:53,436 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:55,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:55,245 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 10:02:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:02:55,246 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:55,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-08 10:02:55,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-08 10:02:55,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-08 10:02:55,280 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:02:55,281 INFO L225 Difference]: With dead ends: 69 [2022-04-08 10:02:55,281 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 10:02:55,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=529, Invalid=2123, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:02:55,281 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:55,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 80 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:02:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 10:02:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 39. [2022-04-08 10:02:55,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:55,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:55,428 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:55,428 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:55,429 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 10:02:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 10:02:55,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:55,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:55,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 10:02:55,429 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-08 10:02:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:55,430 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 10:02:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 10:02:55,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:55,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:55,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:55,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 10:02:55,430 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-08 10:02:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:55,431 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 10:02:55,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:55,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 10:02:55,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:02:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:02:55,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:55,636 INFO L499 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:55,654 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:02:55,852 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:02:55,852 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:55,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1725823305, now seen corresponding path program 79 times [2022-04-08 10:02:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:55,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054832608] [2022-04-08 10:02:55,868 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:55,868 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1725823305, now seen corresponding path program 80 times [2022-04-08 10:02:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:55,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689362098] [2022-04-08 10:02:55,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:56,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {20579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {20560#true} is VALID [2022-04-08 10:02:56,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-08 10:02:56,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-08 10:02:56,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {20560#true} call ULTIMATE.init(); {20579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:56,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {20579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {20560#true} is VALID [2022-04-08 10:02:56,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-08 10:02:56,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-08 10:02:56,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {20560#true} call #t~ret9 := main(); {20560#true} is VALID [2022-04-08 10:02:56,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {20560#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20565#(= main_~y~0 0)} is VALID [2022-04-08 10:02:56,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {20565#(= 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; {20566#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:56,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {20566#(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; {20567#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:56,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {20567#(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; {20568#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:56,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {20568#(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; {20569#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:56,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {20569#(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; {20570#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:56,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {20570#(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; {20571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:56,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {20571#(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; {20572#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:56,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {20572#(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; {20573#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:56,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {20573#(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; {20574#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:56,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {20574#(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; {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:56,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:56,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {20576#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:02:56,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {20576#(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; {20577#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:56,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {20577#(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; {20578#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:56,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {20578#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20561#false} is VALID [2022-04-08 10:02:56,073 INFO L272 TraceCheckUtils]: 21: Hoare triple {20561#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20561#false} is VALID [2022-04-08 10:02:56,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {20561#false} ~cond := #in~cond; {20561#false} is VALID [2022-04-08 10:02:56,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {20561#false} assume 0 == ~cond; {20561#false} is VALID [2022-04-08 10:02:56,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {20561#false} assume !false; {20561#false} is VALID [2022-04-08 10:02:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:56,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689362098] [2022-04-08 10:02:56,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689362098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:56,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595139535] [2022-04-08 10:02:56,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:02:56,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:56,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:56,074 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:02:56,075 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:02:56,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:02:56,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:56,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:02:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:56,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:56,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {20560#true} call ULTIMATE.init(); {20560#true} is VALID [2022-04-08 10:02:56,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {20560#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); {20560#true} is VALID [2022-04-08 10:02:56,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-08 10:02:56,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-08 10:02:56,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {20560#true} call #t~ret9 := main(); {20560#true} is VALID [2022-04-08 10:02:56,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {20560#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20565#(= main_~y~0 0)} is VALID [2022-04-08 10:02:56,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {20565#(= 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; {20566#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:56,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {20566#(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; {20567#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:56,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {20567#(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; {20568#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:56,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {20568#(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; {20569#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:56,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {20569#(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; {20570#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:56,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {20570#(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; {20571#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:56,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {20571#(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; {20572#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:56,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {20572#(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; {20573#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:56,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {20573#(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; {20574#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:56,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {20574#(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; {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:56,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:56,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {20575#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {20576#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:02:56,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {20576#(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; {20577#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:02:56,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {20577#(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; {20640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:02:56,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {20640#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {20561#false} is VALID [2022-04-08 10:02:56,326 INFO L272 TraceCheckUtils]: 21: Hoare triple {20561#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20561#false} is VALID [2022-04-08 10:02:56,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {20561#false} ~cond := #in~cond; {20561#false} is VALID [2022-04-08 10:02:56,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {20561#false} assume 0 == ~cond; {20561#false} is VALID [2022-04-08 10:02:56,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {20561#false} assume !false; {20561#false} is VALID [2022-04-08 10:02:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:56,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:02:56,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {20561#false} assume !false; {20561#false} is VALID [2022-04-08 10:02:56,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {20561#false} assume 0 == ~cond; {20561#false} is VALID [2022-04-08 10:02:56,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {20561#false} ~cond := #in~cond; {20561#false} is VALID [2022-04-08 10:02:56,751 INFO L272 TraceCheckUtils]: 21: Hoare triple {20561#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20561#false} is VALID [2022-04-08 10:02:56,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {20668#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20561#false} is VALID [2022-04-08 10:02:56,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {20672#(< 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; {20668#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:02:56,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {20676#(< 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; {20672#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:56,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {20680#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {20676#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:56,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {20680#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20680#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:56,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {20687#(< 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; {20680#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:02:56,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {20691#(< 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; {20687#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:02:56,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {20695#(< 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; {20691#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:02:56,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {20699#(< 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; {20695#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:02:56,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {20703#(< 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; {20699#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:02:56,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {20707#(< 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; {20703#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:02:56,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {20711#(< 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; {20707#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:02:56,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {20715#(< 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; {20711#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:56,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {20719#(< 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; {20715#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:02:56,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {20723#(< 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; {20719#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:02:56,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {20560#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20723#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:02:56,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {20560#true} call #t~ret9 := main(); {20560#true} is VALID [2022-04-08 10:02:56,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20560#true} {20560#true} #50#return; {20560#true} is VALID [2022-04-08 10:02:56,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {20560#true} assume true; {20560#true} is VALID [2022-04-08 10:02:56,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {20560#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); {20560#true} is VALID [2022-04-08 10:02:56,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {20560#true} call ULTIMATE.init(); {20560#true} is VALID [2022-04-08 10:02:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:56,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595139535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:02:56,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:02:56,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:02:56,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:02:56,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054832608] [2022-04-08 10:02:56,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054832608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:02:56,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:02:56,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:02:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628074649] [2022-04-08 10:02:56,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:02:56,759 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:56,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:02:56,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:56,771 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:02:56,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:02:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:56,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:02:56,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:02:56,771 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,513 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-08 10:02:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:02:58,513 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:02:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 62 transitions. [2022-04-08 10:02:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 62 transitions. [2022-04-08 10:02:58,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 62 transitions. [2022-04-08 10:02:58,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:58,562 INFO L225 Difference]: With dead ends: 73 [2022-04-08 10:02:58,562 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 10:02:58,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:02:58,562 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:02:58,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 90 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:02:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 10:02:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2022-04-08 10:02:58,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:02:58,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,765 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,765 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,766 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-08 10:02:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-04-08 10:02:58,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-08 10:02:58,779 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-08 10:02:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:02:58,780 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-08 10:02:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-04-08 10:02:58,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:02:58,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:02:58,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:02:58,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:02:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:02:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 10:02:58,786 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-08 10:02:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:02:58,786 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 10:02:58,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:02:58,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 10:02:58,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:02:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:02:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:02:58,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:02:58,987 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:02:59,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-08 10:02:59,187 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:02:59,187 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:02:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:02:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1984676406, now seen corresponding path program 81 times [2022-04-08 10:02:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:02:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1280066904] [2022-04-08 10:02:59,191 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:02:59,191 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:02:59,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1984676406, now seen corresponding path program 82 times [2022-04-08 10:02:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:02:59,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850759946] [2022-04-08 10:02:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:02:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:02:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:02:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:59,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {21157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {21138#true} is VALID [2022-04-08 10:02:59,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-08 10:02:59,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-08 10:02:59,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {21138#true} call ULTIMATE.init(); {21157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:02:59,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {21157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {21138#true} is VALID [2022-04-08 10:02:59,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-08 10:02:59,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-08 10:02:59,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {21138#true} call #t~ret9 := main(); {21138#true} is VALID [2022-04-08 10:02:59,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {21138#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21143#(= main_~y~0 0)} is VALID [2022-04-08 10:02:59,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {21143#(= 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; {21144#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:59,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {21144#(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; {21145#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:59,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {21145#(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; {21146#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:59,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {21146#(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; {21147#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:59,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {21147#(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; {21148#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:59,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {21148#(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; {21149#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:59,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {21149#(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; {21150#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:59,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {21150#(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; {21151#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:59,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {21151#(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; {21152#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:59,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {21152#(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; {21153#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:59,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {21153#(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; {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:59,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:59,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {21155#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:02:59,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {21155#(and (<= main_~z~0 11) (<= 11 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; {21156#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:02:59,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {21156#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21139#false} is VALID [2022-04-08 10:02:59,397 INFO L272 TraceCheckUtils]: 21: Hoare triple {21139#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21139#false} is VALID [2022-04-08 10:02:59,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#false} ~cond := #in~cond; {21139#false} is VALID [2022-04-08 10:02:59,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#false} assume 0 == ~cond; {21139#false} is VALID [2022-04-08 10:02:59,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {21139#false} assume !false; {21139#false} is VALID [2022-04-08 10:02:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:02:59,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850759946] [2022-04-08 10:02:59,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850759946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:02:59,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819933724] [2022-04-08 10:02:59,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:02:59,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:02:59,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:02:59,398 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:02:59,399 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:02:59,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:02:59,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:02:59,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:02:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:02:59,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:02:59,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {21138#true} call ULTIMATE.init(); {21138#true} is VALID [2022-04-08 10:02:59,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {21138#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); {21138#true} is VALID [2022-04-08 10:02:59,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-08 10:02:59,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-08 10:02:59,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {21138#true} call #t~ret9 := main(); {21138#true} is VALID [2022-04-08 10:02:59,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {21138#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21143#(= main_~y~0 0)} is VALID [2022-04-08 10:02:59,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {21143#(= 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; {21144#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:02:59,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {21144#(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; {21145#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:02:59,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {21145#(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; {21146#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:02:59,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {21146#(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; {21147#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:02:59,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {21147#(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; {21148#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:02:59,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {21148#(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; {21149#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:02:59,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {21149#(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; {21150#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:02:59,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {21150#(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; {21151#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:02:59,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {21151#(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; {21152#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:02:59,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {21152#(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; {21153#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:02:59,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {21153#(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; {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:59,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:02:59,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {21154#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {21155#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:02:59,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {21155#(and (<= main_~z~0 11) (<= 11 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; {21218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:02:59,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {21218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21139#false} is VALID [2022-04-08 10:02:59,700 INFO L272 TraceCheckUtils]: 21: Hoare triple {21139#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21139#false} is VALID [2022-04-08 10:02:59,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#false} ~cond := #in~cond; {21139#false} is VALID [2022-04-08 10:02:59,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#false} assume 0 == ~cond; {21139#false} is VALID [2022-04-08 10:02:59,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {21139#false} assume !false; {21139#false} is VALID [2022-04-08 10:02:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:02:59,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:00,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {21139#false} assume !false; {21139#false} is VALID [2022-04-08 10:03:00,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {21139#false} assume 0 == ~cond; {21139#false} is VALID [2022-04-08 10:03:00,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {21139#false} ~cond := #in~cond; {21139#false} is VALID [2022-04-08 10:03:00,046 INFO L272 TraceCheckUtils]: 21: Hoare triple {21139#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21139#false} is VALID [2022-04-08 10:03:00,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {21246#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21139#false} is VALID [2022-04-08 10:03:00,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {21250#(< 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; {21246#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:00,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {21254#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {21250#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:00,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {21254#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {21254#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:00,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {21261#(< 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; {21254#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:00,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {21265#(< 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; {21261#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:00,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {21269#(< 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; {21265#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:00,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {21273#(< 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; {21269#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:00,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {21277#(< 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; {21273#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:00,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {21281#(< 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; {21277#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:00,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {21285#(< 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; {21281#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:00,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {21289#(< 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; {21285#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:00,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {21293#(< 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; {21289#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:00,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {21297#(< 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; {21293#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:00,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {21301#(< 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; {21297#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:00,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {21138#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21301#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:00,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {21138#true} call #t~ret9 := main(); {21138#true} is VALID [2022-04-08 10:03:00,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21138#true} {21138#true} #50#return; {21138#true} is VALID [2022-04-08 10:03:00,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {21138#true} assume true; {21138#true} is VALID [2022-04-08 10:03:00,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {21138#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); {21138#true} is VALID [2022-04-08 10:03:00,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {21138#true} call ULTIMATE.init(); {21138#true} is VALID [2022-04-08 10:03:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:00,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819933724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:00,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:03:00,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:00,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1280066904] [2022-04-08 10:03:00,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1280066904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:00,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:00,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:03:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171784903] [2022-04-08 10:03:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:00,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:00,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:00,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:00,064 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:03:00,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:03:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:00,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:03:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:03:00,065 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:01,402 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-04-08 10:03:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:03:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-08 10:03:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 65 transitions. [2022-04-08 10:03:01,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 65 transitions. [2022-04-08 10:03:01,435 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:03:01,435 INFO L225 Difference]: With dead ends: 76 [2022-04-08 10:03:01,435 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 10:03:01,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:03:01,436 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:01,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 105 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 10:03:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2022-04-08 10:03:01,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:01,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,583 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,583 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:01,583 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-08 10:03:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-08 10:03:01,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:01,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:01,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-08 10:03:01,584 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-08 10:03:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:01,584 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-08 10:03:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-08 10:03:01,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:01,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:01,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:01,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 10:03:01,585 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 25 [2022-04-08 10:03:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:01,585 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 10:03:01,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:01,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 10:03:01,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:03:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:03:01,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:01,784 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:01,801 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:03:01,999 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:03:01,999 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash -112387369, now seen corresponding path program 23 times [2022-04-08 10:03:02,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:02,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351785790] [2022-04-08 10:03:02,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:02,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash -112387369, now seen corresponding path program 24 times [2022-04-08 10:03:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:02,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107214985] [2022-04-08 10:03:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:02,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:02,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:02,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {21743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {21724#true} is VALID [2022-04-08 10:03:02,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-08 10:03:02,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-08 10:03:02,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {21724#true} call ULTIMATE.init(); {21743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:02,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {21743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {21724#true} is VALID [2022-04-08 10:03:02,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-08 10:03:02,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-08 10:03:02,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {21724#true} call #t~ret9 := main(); {21724#true} is VALID [2022-04-08 10:03:02,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {21724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21729#(= main_~y~0 0)} is VALID [2022-04-08 10:03:02,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {21729#(= 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; {21730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {21730#(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; {21731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:02,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {21731#(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; {21732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:02,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {21732#(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; {21733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:02,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {21733#(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; {21734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:02,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {21734#(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; {21735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:02,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {21735#(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; {21736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:02,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {21736#(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; {21737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:02,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {21737#(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; {21738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:02,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {21738#(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; {21739#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:02,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {21739#(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; {21740#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:02,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {21740#(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; {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:02,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:02,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {21742#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:02,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {21742#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21725#false} is VALID [2022-04-08 10:03:02,222 INFO L272 TraceCheckUtils]: 21: Hoare triple {21725#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21725#false} is VALID [2022-04-08 10:03:02,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#false} ~cond := #in~cond; {21725#false} is VALID [2022-04-08 10:03:02,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {21725#false} assume 0 == ~cond; {21725#false} is VALID [2022-04-08 10:03:02,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {21725#false} assume !false; {21725#false} is VALID [2022-04-08 10:03:02,222 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:03:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:02,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107214985] [2022-04-08 10:03:02,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107214985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:02,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329202819] [2022-04-08 10:03:02,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:02,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:02,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:02,240 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:03:02,259 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:03:02,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:03:02,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:02,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:03:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:02,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:02,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {21724#true} call ULTIMATE.init(); {21724#true} is VALID [2022-04-08 10:03:02,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {21724#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); {21724#true} is VALID [2022-04-08 10:03:02,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-08 10:03:02,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-08 10:03:02,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {21724#true} call #t~ret9 := main(); {21724#true} is VALID [2022-04-08 10:03:02,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {21724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21729#(= main_~y~0 0)} is VALID [2022-04-08 10:03:02,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {21729#(= 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; {21730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:02,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {21730#(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; {21731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:02,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {21731#(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; {21732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:02,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {21732#(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; {21733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:02,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {21733#(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; {21734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:02,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {21734#(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; {21735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:02,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {21735#(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; {21736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:02,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {21736#(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; {21737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:02,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {21737#(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; {21738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:02,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {21738#(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; {21739#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:02,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {21739#(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; {21740#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:02,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {21740#(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; {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:02,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:02,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {21741#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {21804#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:02,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {21804#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {21725#false} is VALID [2022-04-08 10:03:02,555 INFO L272 TraceCheckUtils]: 21: Hoare triple {21725#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21725#false} is VALID [2022-04-08 10:03:02,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#false} ~cond := #in~cond; {21725#false} is VALID [2022-04-08 10:03:02,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {21725#false} assume 0 == ~cond; {21725#false} is VALID [2022-04-08 10:03:02,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {21725#false} assume !false; {21725#false} is VALID [2022-04-08 10:03:02,555 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:03:02,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:02,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {21725#false} assume !false; {21725#false} is VALID [2022-04-08 10:03:02,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {21725#false} assume 0 == ~cond; {21725#false} is VALID [2022-04-08 10:03:02,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#false} ~cond := #in~cond; {21725#false} is VALID [2022-04-08 10:03:02,900 INFO L272 TraceCheckUtils]: 21: Hoare triple {21725#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21725#false} is VALID [2022-04-08 10:03:02,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {21832#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21725#false} is VALID [2022-04-08 10:03:02,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {21836#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {21832#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:02,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {21836#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21836#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:02,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {21843#(< 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; {21836#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:02,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {21847#(< 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; {21843#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:02,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {21851#(< 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; {21847#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:02,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {21855#(< 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; {21851#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:02,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {21859#(< 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; {21855#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:02,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {21863#(< 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; {21859#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:02,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {21867#(< 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; {21863#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:02,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {21871#(< 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; {21867#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:02,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {21875#(< 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; {21871#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:02,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {21879#(< 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; {21875#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:02,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {21883#(< 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; {21879#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:02,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {21887#(< 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; {21883#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:03:02,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {21724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21887#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:03:02,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {21724#true} call #t~ret9 := main(); {21724#true} is VALID [2022-04-08 10:03:02,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21724#true} {21724#true} #50#return; {21724#true} is VALID [2022-04-08 10:03:02,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {21724#true} assume true; {21724#true} is VALID [2022-04-08 10:03:02,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {21724#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); {21724#true} is VALID [2022-04-08 10:03:02,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {21724#true} call ULTIMATE.init(); {21724#true} is VALID [2022-04-08 10:03:02,909 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:03:02,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329202819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:02,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:02,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:03:02,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:02,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351785790] [2022-04-08 10:03:02,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351785790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:02,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:02,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:03:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933851550] [2022-04-08 10:03:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:02,911 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:02,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:02,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:02,927 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:03:02,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:03:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:02,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:03:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:03:02,928 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:04,833 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2022-04-08 10:03:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:03:04,833 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-08 10:03:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 69 transitions. [2022-04-08 10:03:04,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 69 transitions. [2022-04-08 10:03:04,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:04,889 INFO L225 Difference]: With dead ends: 81 [2022-04-08 10:03:04,889 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 10:03:04,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 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:03:04,890 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:04,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 108 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:03:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 10:03:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 41. [2022-04-08 10:03:05,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:05,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,080 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,080 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:05,081 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 10:03:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 10:03:05,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:05,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:05,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-08 10:03:05,081 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-08 10:03:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:05,082 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 10:03:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2022-04-08 10:03:05,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:05,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:05,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:05,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-08 10:03:05,082 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 25 [2022-04-08 10:03:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:05,083 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-08 10:03:05,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 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:03:05,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-08 10:03:05,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-08 10:03:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:05,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:05,294 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:05,312 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:03:05,507 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:03:05,507 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash -36326709, now seen corresponding path program 83 times [2022-04-08 10:03:05,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128698206] [2022-04-08 10:03:05,509 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:05,509 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash -36326709, now seen corresponding path program 84 times [2022-04-08 10:03:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:05,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561128181] [2022-04-08 10:03:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:05,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:05,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {22351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {22332#true} is VALID [2022-04-08 10:03:05,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-08 10:03:05,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-08 10:03:05,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {22332#true} call ULTIMATE.init(); {22351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:05,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {22351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {22332#true} is VALID [2022-04-08 10:03:05,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-08 10:03:05,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-08 10:03:05,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {22332#true} call #t~ret9 := main(); {22332#true} is VALID [2022-04-08 10:03:05,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {22332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22337#(= main_~y~0 0)} is VALID [2022-04-08 10:03:05,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {22337#(= 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; {22338#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:05,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {22338#(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; {22339#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:05,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {22339#(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; {22340#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:05,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {22340#(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; {22341#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:05,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {22341#(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; {22342#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:05,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {22342#(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; {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:05,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:05,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {22344#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:05,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {22344#(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; {22345#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:05,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {22345#(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; {22346#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:05,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {22346#(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; {22347#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:05,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {22347#(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; {22348#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:05,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {22348#(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; {22349#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:05,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {22349#(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; {22350#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:05,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {22350#(and (<= main_~z~0 0) (<= 0 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; {22333#false} is VALID [2022-04-08 10:03:05,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {22333#false} assume !(~z~0 % 4294967296 > 0); {22333#false} is VALID [2022-04-08 10:03:05,750 INFO L272 TraceCheckUtils]: 22: Hoare triple {22333#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22333#false} is VALID [2022-04-08 10:03:05,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {22333#false} ~cond := #in~cond; {22333#false} is VALID [2022-04-08 10:03:05,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#false} assume 0 == ~cond; {22333#false} is VALID [2022-04-08 10:03:05,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {22333#false} assume !false; {22333#false} is VALID [2022-04-08 10:03:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:05,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:05,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561128181] [2022-04-08 10:03:05,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561128181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:05,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621187886] [2022-04-08 10:03:05,751 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:05,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:05,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:05,752 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:03:05,764 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:03:05,819 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:03:05,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:05,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:05,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:06,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {22332#true} call ULTIMATE.init(); {22332#true} is VALID [2022-04-08 10:03:06,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {22332#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); {22332#true} is VALID [2022-04-08 10:03:06,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-08 10:03:06,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-08 10:03:06,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {22332#true} call #t~ret9 := main(); {22332#true} is VALID [2022-04-08 10:03:06,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {22332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22337#(= main_~y~0 0)} is VALID [2022-04-08 10:03:06,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {22337#(= 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; {22338#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:06,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {22338#(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; {22339#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:06,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {22339#(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; {22340#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:06,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {22340#(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; {22341#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:06,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {22341#(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; {22342#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:06,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {22342#(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; {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:06,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:06,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {22343#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {22344#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:06,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {22344#(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; {22345#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:06,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {22345#(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; {22346#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:06,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {22346#(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; {22347#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:06,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {22347#(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; {22348#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:06,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {22348#(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; {22349#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:06,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {22349#(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; {22350#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:06,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {22350#(and (<= main_~z~0 0) (<= 0 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; {22415#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:06,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {22415#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {22333#false} is VALID [2022-04-08 10:03:06,054 INFO L272 TraceCheckUtils]: 22: Hoare triple {22333#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22333#false} is VALID [2022-04-08 10:03:06,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {22333#false} ~cond := #in~cond; {22333#false} is VALID [2022-04-08 10:03:06,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#false} assume 0 == ~cond; {22333#false} is VALID [2022-04-08 10:03:06,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {22333#false} assume !false; {22333#false} is VALID [2022-04-08 10:03:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:06,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:06,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {22333#false} assume !false; {22333#false} is VALID [2022-04-08 10:03:06,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {22333#false} assume 0 == ~cond; {22333#false} is VALID [2022-04-08 10:03:06,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {22333#false} ~cond := #in~cond; {22333#false} is VALID [2022-04-08 10:03:06,308 INFO L272 TraceCheckUtils]: 22: Hoare triple {22333#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22333#false} is VALID [2022-04-08 10:03:06,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {22443#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22333#false} is VALID [2022-04-08 10:03:06,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {22447#(< 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; {22443#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:06,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {22451#(< 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; {22447#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:06,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {22455#(< 0 (mod (+ main_~z~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; {22451#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:06,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {22459#(< 0 (mod (+ 4294967292 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; {22455#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:06,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {22463#(< 0 (mod (+ 4294967291 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; {22459#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:06,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {22467#(< 0 (mod (+ 4294967290 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; {22463#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:06,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {22471#(< 0 (mod (+ main_~z~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; {22467#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:06,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {22475#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {22471#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:03:06,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {22475#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {22475#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:03:06,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {22482#(< 0 (mod (+ 4294967290 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; {22475#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:03:06,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {22486#(< 0 (mod (+ 4294967291 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; {22482#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:06,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {22490#(< 0 (mod (+ 4294967292 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; {22486#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:06,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {22494#(< 0 (mod (+ main_~y~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; {22490#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:06,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {22498#(< 0 (mod (+ main_~y~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; {22494#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:06,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {22502#(< 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; {22498#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:06,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {22332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22502#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:06,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {22332#true} call #t~ret9 := main(); {22332#true} is VALID [2022-04-08 10:03:06,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22332#true} {22332#true} #50#return; {22332#true} is VALID [2022-04-08 10:03:06,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {22332#true} assume true; {22332#true} is VALID [2022-04-08 10:03:06,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {22332#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); {22332#true} is VALID [2022-04-08 10:03:06,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {22332#true} call ULTIMATE.init(); {22332#true} is VALID [2022-04-08 10:03:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:06,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621187886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:06,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:06,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2022-04-08 10:03:06,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128698206] [2022-04-08 10:03:06,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128698206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:06,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:06,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:03:06,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796676388] [2022-04-08 10:03:06,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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:03:06,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:06,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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:03:06,331 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:03:06,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:03:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:06,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:03:06,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:03:06,331 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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:03:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:07,078 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 10:03:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:03:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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:03:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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:03:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-08 10:03:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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:03:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2022-04-08 10:03:07,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 37 transitions. [2022-04-08 10:03:07,118 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:03:07,119 INFO L225 Difference]: With dead ends: 53 [2022-04-08 10:03:07,119 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 10:03:07,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:03:07,119 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:07,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 84 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 10:03:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 10:03:07,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:07,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,265 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,265 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:07,265 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 10:03:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:03:07,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:07,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:07,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 10:03:07,266 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-08 10:03:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:07,266 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 10:03:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:03:07,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:07,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:07,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:07,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-08 10:03:07,267 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-08 10:03:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:07,267 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-08 10:03:07,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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:03:07,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-08 10:03:07,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-08 10:03:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:07,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:07,493 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:07,509 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:03:07,704 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:03:07,704 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:07,705 INFO L85 PathProgramCache]: Analyzing trace with hash -448770388, now seen corresponding path program 85 times [2022-04-08 10:03:07,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:07,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886756800] [2022-04-08 10:03:07,707 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:07,707 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash -448770388, now seen corresponding path program 86 times [2022-04-08 10:03:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:07,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69724457] [2022-04-08 10:03:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:07,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {22833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {22813#true} is VALID [2022-04-08 10:03:07,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-08 10:03:07,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-08 10:03:07,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {22813#true} call ULTIMATE.init(); {22833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:07,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {22833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {22813#true} is VALID [2022-04-08 10:03:07,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-08 10:03:07,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-08 10:03:07,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {22813#true} call #t~ret9 := main(); {22813#true} is VALID [2022-04-08 10:03:07,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {22813#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22818#(= main_~y~0 0)} is VALID [2022-04-08 10:03:07,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {22818#(= 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; {22819#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:07,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {22819#(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; {22820#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:07,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {22820#(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; {22821#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:07,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {22821#(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; {22822#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:07,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {22822#(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; {22823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:07,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {22823#(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; {22824#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:07,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {22824#(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; {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:07,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:07,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {22826#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:07,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {22826#(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; {22827#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:07,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {22827#(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; {22828#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:07,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {22828#(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; {22829#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:07,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {22829#(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; {22830#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:07,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {22830#(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; {22831#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:07,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {22831#(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; {22832#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:07,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {22832#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {22814#false} is VALID [2022-04-08 10:03:07,927 INFO L272 TraceCheckUtils]: 22: Hoare triple {22814#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22814#false} is VALID [2022-04-08 10:03:07,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {22814#false} ~cond := #in~cond; {22814#false} is VALID [2022-04-08 10:03:07,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {22814#false} assume 0 == ~cond; {22814#false} is VALID [2022-04-08 10:03:07,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {22814#false} assume !false; {22814#false} is VALID [2022-04-08 10:03:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:07,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69724457] [2022-04-08 10:03:07,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69724457] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:07,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893798653] [2022-04-08 10:03:07,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:07,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:07,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:07,929 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:03:07,944 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:03:07,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:07,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:07,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:07,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:08,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {22813#true} call ULTIMATE.init(); {22813#true} is VALID [2022-04-08 10:03:08,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {22813#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); {22813#true} is VALID [2022-04-08 10:03:08,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-08 10:03:08,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-08 10:03:08,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {22813#true} call #t~ret9 := main(); {22813#true} is VALID [2022-04-08 10:03:08,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {22813#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22818#(= main_~y~0 0)} is VALID [2022-04-08 10:03:08,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {22818#(= 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; {22819#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:08,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {22819#(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; {22820#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:08,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {22820#(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; {22821#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:08,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {22821#(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; {22822#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:08,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {22822#(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; {22823#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:08,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {22823#(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; {22824#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:08,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {22824#(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; {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:08,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:08,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {22825#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {22826#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:08,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {22826#(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; {22827#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:08,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {22827#(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; {22828#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:08,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {22828#(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; {22829#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:08,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {22829#(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; {22830#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:08,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {22830#(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; {22831#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:08,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {22831#(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; {22897#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:08,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {22897#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {22814#false} is VALID [2022-04-08 10:03:08,203 INFO L272 TraceCheckUtils]: 22: Hoare triple {22814#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22814#false} is VALID [2022-04-08 10:03:08,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {22814#false} ~cond := #in~cond; {22814#false} is VALID [2022-04-08 10:03:08,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {22814#false} assume 0 == ~cond; {22814#false} is VALID [2022-04-08 10:03:08,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {22814#false} assume !false; {22814#false} is VALID [2022-04-08 10:03:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:08,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:08,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {22814#false} assume !false; {22814#false} is VALID [2022-04-08 10:03:08,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {22814#false} assume 0 == ~cond; {22814#false} is VALID [2022-04-08 10:03:08,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {22814#false} ~cond := #in~cond; {22814#false} is VALID [2022-04-08 10:03:08,550 INFO L272 TraceCheckUtils]: 22: Hoare triple {22814#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22814#false} is VALID [2022-04-08 10:03:08,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {22925#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22814#false} is VALID [2022-04-08 10:03:08,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {22929#(< 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; {22925#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:08,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {22933#(< 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; {22929#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:08,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {22937#(< 0 (mod (+ main_~z~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; {22933#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:08,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {22941#(< 0 (mod (+ 4294967292 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; {22937#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:08,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {22945#(< 0 (mod (+ 4294967291 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; {22941#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:08,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {22949#(< 0 (mod (+ 4294967290 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; {22945#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:08,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {22953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {22949#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:08,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {22953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {22953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:08,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {22960#(< 0 (mod (+ 4294967291 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; {22953#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:08,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {22964#(< 0 (mod (+ 4294967292 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; {22960#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:08,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {22968#(< 0 (mod (+ main_~y~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; {22964#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:08,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {22972#(< 0 (mod (+ main_~y~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; {22968#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:08,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {22976#(< 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; {22972#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:08,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {22980#(< 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; {22976#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:08,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {22984#(< 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; {22980#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:08,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {22813#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22984#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:08,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {22813#true} call #t~ret9 := main(); {22813#true} is VALID [2022-04-08 10:03:08,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22813#true} {22813#true} #50#return; {22813#true} is VALID [2022-04-08 10:03:08,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {22813#true} assume true; {22813#true} is VALID [2022-04-08 10:03:08,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {22813#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); {22813#true} is VALID [2022-04-08 10:03:08,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {22813#true} call ULTIMATE.init(); {22813#true} is VALID [2022-04-08 10:03:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:08,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893798653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:08,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:08,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:08,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:08,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886756800] [2022-04-08 10:03:08,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886756800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:08,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:08,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:08,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971304551] [2022-04-08 10:03:08,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:08,561 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:08,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:08,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:08,574 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:03:08,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:08,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:08,575 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:09,471 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-08 10:03:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:03:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-08 10:03:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-08 10:03:09,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 40 transitions. [2022-04-08 10:03:09,500 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:03:09,500 INFO L225 Difference]: With dead ends: 52 [2022-04-08 10:03:09,500 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:03:09,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=410, Invalid=1942, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:03:09,512 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:09,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:03:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-04-08 10:03:09,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:09,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,680 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,680 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:09,680 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-08 10:03:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-08 10:03:09,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:09,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:09,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:03:09,681 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:03:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:09,681 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-08 10:03:09,681 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-08 10:03:09,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:09,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:09,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:09,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 10:03:09,682 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-08 10:03:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:09,682 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 10:03:09,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:09,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 10:03:09,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 10:03:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:09,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:09,934 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:09,950 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:03:10,144 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:03:10,144 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1477587627, now seen corresponding path program 87 times [2022-04-08 10:03:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970230997] [2022-04-08 10:03:10,147 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:10,147 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1477587627, now seen corresponding path program 88 times [2022-04-08 10:03:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:10,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465194316] [2022-04-08 10:03:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {23333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {23313#true} is VALID [2022-04-08 10:03:10,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-08 10:03:10,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-08 10:03:10,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {23313#true} call ULTIMATE.init(); {23333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:10,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {23333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {23313#true} is VALID [2022-04-08 10:03:10,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-08 10:03:10,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-08 10:03:10,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {23313#true} call #t~ret9 := main(); {23313#true} is VALID [2022-04-08 10:03:10,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {23313#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23318#(= main_~y~0 0)} is VALID [2022-04-08 10:03:10,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {23318#(= 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; {23319#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:10,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {23319#(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; {23320#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:10,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {23320#(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; {23321#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {23321#(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; {23322#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:10,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {23322#(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; {23323#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:10,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {23323#(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; {23324#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:10,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {23324#(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; {23325#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:10,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {23325#(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; {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:10,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:10,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {23327#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:10,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {23327#(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; {23328#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:10,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {23328#(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; {23329#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:10,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {23329#(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; {23330#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:10,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {23330#(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; {23331#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:10,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {23331#(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; {23332#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:10,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {23332#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23314#false} is VALID [2022-04-08 10:03:10,413 INFO L272 TraceCheckUtils]: 22: Hoare triple {23314#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23314#false} is VALID [2022-04-08 10:03:10,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {23314#false} ~cond := #in~cond; {23314#false} is VALID [2022-04-08 10:03:10,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {23314#false} assume 0 == ~cond; {23314#false} is VALID [2022-04-08 10:03:10,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#false} assume !false; {23314#false} is VALID [2022-04-08 10:03:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:10,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:10,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465194316] [2022-04-08 10:03:10,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465194316] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:10,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230970668] [2022-04-08 10:03:10,414 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:10,415 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:03:10,416 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:03:10,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:10,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:10,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:10,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {23313#true} call ULTIMATE.init(); {23313#true} is VALID [2022-04-08 10:03:10,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {23313#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); {23313#true} is VALID [2022-04-08 10:03:10,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-08 10:03:10,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-08 10:03:10,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {23313#true} call #t~ret9 := main(); {23313#true} is VALID [2022-04-08 10:03:10,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {23313#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23318#(= main_~y~0 0)} is VALID [2022-04-08 10:03:10,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {23318#(= 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; {23319#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:10,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {23319#(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; {23320#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:10,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {23320#(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; {23321#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:10,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {23321#(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; {23322#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:10,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {23322#(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; {23323#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:10,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {23323#(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; {23324#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:10,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {23324#(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; {23325#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:10,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {23325#(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; {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:10,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:10,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {23326#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {23327#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:10,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {23327#(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; {23328#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:10,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {23328#(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; {23329#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:10,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {23329#(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; {23330#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:10,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {23330#(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; {23331#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:10,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {23331#(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; {23397#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:10,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {23397#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23314#false} is VALID [2022-04-08 10:03:10,702 INFO L272 TraceCheckUtils]: 22: Hoare triple {23314#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23314#false} is VALID [2022-04-08 10:03:10,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {23314#false} ~cond := #in~cond; {23314#false} is VALID [2022-04-08 10:03:10,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {23314#false} assume 0 == ~cond; {23314#false} is VALID [2022-04-08 10:03:10,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#false} assume !false; {23314#false} is VALID [2022-04-08 10:03:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:10,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:11,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {23314#false} assume !false; {23314#false} is VALID [2022-04-08 10:03:11,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {23314#false} assume 0 == ~cond; {23314#false} is VALID [2022-04-08 10:03:11,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {23314#false} ~cond := #in~cond; {23314#false} is VALID [2022-04-08 10:03:11,073 INFO L272 TraceCheckUtils]: 22: Hoare triple {23314#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23314#false} is VALID [2022-04-08 10:03:11,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {23425#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23314#false} is VALID [2022-04-08 10:03:11,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {23429#(< 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; {23425#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:11,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {23433#(< 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; {23429#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:11,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {23437#(< 0 (mod (+ main_~z~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; {23433#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:11,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {23441#(< 0 (mod (+ 4294967292 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; {23437#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:11,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {23445#(< 0 (mod (+ 4294967291 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; {23441#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:11,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {23449#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {23445#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:11,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {23449#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23449#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:11,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {23456#(< 0 (mod (+ 4294967292 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; {23449#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:11,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {23460#(< 0 (mod (+ main_~y~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; {23456#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:11,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {23464#(< 0 (mod (+ main_~y~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; {23460#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:11,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {23468#(< 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; {23464#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:11,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {23472#(< 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; {23468#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:11,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {23476#(< 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; {23472#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:11,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {23480#(< 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; {23476#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:11,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {23484#(< 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; {23480#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:11,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {23313#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23484#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:11,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {23313#true} call #t~ret9 := main(); {23313#true} is VALID [2022-04-08 10:03:11,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23313#true} {23313#true} #50#return; {23313#true} is VALID [2022-04-08 10:03:11,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {23313#true} assume true; {23313#true} is VALID [2022-04-08 10:03:11,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {23313#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); {23313#true} is VALID [2022-04-08 10:03:11,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {23313#true} call ULTIMATE.init(); {23313#true} is VALID [2022-04-08 10:03:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:11,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230970668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:11,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:11,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:11,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:11,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970230997] [2022-04-08 10:03:11,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970230997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:11,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:11,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135695652] [2022-04-08 10:03:11,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:11,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:11,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:11,100 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:03:11,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:11,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=940, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:11,101 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:12,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,393 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-08 10:03:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:03:12,393 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2022-04-08 10:03:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2022-04-08 10:03:12,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 50 transitions. [2022-04-08 10:03:12,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:12,420 INFO L225 Difference]: With dead ends: 59 [2022-04-08 10:03:12,420 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 10:03:12,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=532, Invalid=2330, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:03:12,421 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:12,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 10:03:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-04-08 10:03:12,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:12,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,576 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,576 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,577 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 10:03:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 10:03:12,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:12,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:12,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-08 10:03:12,577 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-08 10:03:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,578 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 10:03:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 10:03:12,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:12,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:12,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:12,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 10:03:12,578 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-08 10:03:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:12,579 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 10:03:12,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:12,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 10:03:12,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 10:03:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:12,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:12,794 INFO L499 BasicCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:12,811 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:03:13,007 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:03:13,007 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1401180876, now seen corresponding path program 89 times [2022-04-08 10:03:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:13,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548070855] [2022-04-08 10:03:13,009 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:13,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1401180876, now seen corresponding path program 90 times [2022-04-08 10:03:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:13,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309570529] [2022-04-08 10:03:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {23871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {23851#true} is VALID [2022-04-08 10:03:13,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-08 10:03:13,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-08 10:03:13,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {23851#true} call ULTIMATE.init(); {23871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:13,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {23871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {23851#true} is VALID [2022-04-08 10:03:13,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-08 10:03:13,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-08 10:03:13,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {23851#true} call #t~ret9 := main(); {23851#true} is VALID [2022-04-08 10:03:13,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {23851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23856#(= main_~y~0 0)} is VALID [2022-04-08 10:03:13,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {23856#(= 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; {23857#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:13,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {23857#(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; {23858#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:13,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {23858#(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; {23859#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:13,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {23859#(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; {23860#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:13,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {23860#(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; {23861#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:13,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {23861#(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; {23862#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:13,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {23862#(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; {23863#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:13,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {23863#(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; {23864#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:13,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {23864#(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; {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:13,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:13,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {23866#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:13,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {23866#(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; {23867#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:13,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {23867#(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; {23868#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:13,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {23868#(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; {23869#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:13,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {23869#(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; {23870#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:13,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {23870#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23852#false} is VALID [2022-04-08 10:03:13,257 INFO L272 TraceCheckUtils]: 22: Hoare triple {23852#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23852#false} is VALID [2022-04-08 10:03:13,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {23852#false} ~cond := #in~cond; {23852#false} is VALID [2022-04-08 10:03:13,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {23852#false} assume 0 == ~cond; {23852#false} is VALID [2022-04-08 10:03:13,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {23852#false} assume !false; {23852#false} is VALID [2022-04-08 10:03:13,257 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:03:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:13,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309570529] [2022-04-08 10:03:13,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309570529] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:13,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253589223] [2022-04-08 10:03:13,258 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:13,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:13,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:13,259 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:03:13,259 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:03:13,332 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:03:13,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:13,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:13,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {23851#true} call ULTIMATE.init(); {23851#true} is VALID [2022-04-08 10:03:13,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {23851#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); {23851#true} is VALID [2022-04-08 10:03:13,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-08 10:03:13,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-08 10:03:13,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {23851#true} call #t~ret9 := main(); {23851#true} is VALID [2022-04-08 10:03:13,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {23851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23856#(= main_~y~0 0)} is VALID [2022-04-08 10:03:13,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {23856#(= 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; {23857#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:13,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {23857#(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; {23858#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:13,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {23858#(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; {23859#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:13,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {23859#(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; {23860#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:13,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {23860#(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; {23861#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:13,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {23861#(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; {23862#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:13,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {23862#(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; {23863#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:13,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {23863#(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; {23864#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:13,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {23864#(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; {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:13,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:13,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {23865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {23866#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:13,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {23866#(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; {23867#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:13,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {23867#(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; {23868#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:13,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {23868#(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; {23869#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:13,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {23869#(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; {23935#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:13,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {23935#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23852#false} is VALID [2022-04-08 10:03:13,588 INFO L272 TraceCheckUtils]: 22: Hoare triple {23852#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23852#false} is VALID [2022-04-08 10:03:13,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {23852#false} ~cond := #in~cond; {23852#false} is VALID [2022-04-08 10:03:13,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {23852#false} assume 0 == ~cond; {23852#false} is VALID [2022-04-08 10:03:13,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {23852#false} assume !false; {23852#false} is VALID [2022-04-08 10:03:13,588 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:03:13,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:14,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {23852#false} assume !false; {23852#false} is VALID [2022-04-08 10:03:14,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {23852#false} assume 0 == ~cond; {23852#false} is VALID [2022-04-08 10:03:14,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {23852#false} ~cond := #in~cond; {23852#false} is VALID [2022-04-08 10:03:14,001 INFO L272 TraceCheckUtils]: 22: Hoare triple {23852#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23852#false} is VALID [2022-04-08 10:03:14,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {23963#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23852#false} is VALID [2022-04-08 10:03:14,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {23967#(< 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; {23963#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:14,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {23971#(< 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; {23967#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:14,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {23975#(< 0 (mod (+ main_~z~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; {23971#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:14,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {23979#(< 0 (mod (+ 4294967292 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; {23975#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:14,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {23983#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {23979#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:14,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {23983#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23983#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:14,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {23990#(< 0 (mod (+ main_~y~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; {23983#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:14,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {23994#(< 0 (mod (+ main_~y~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; {23990#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:14,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {23998#(< 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; {23994#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:14,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {24002#(< 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; {23998#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:14,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {24006#(< 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; {24002#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:14,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {24010#(< 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; {24006#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:14,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {24014#(< 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; {24010#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:14,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {24018#(< 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; {24014#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:14,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {24022#(< 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; {24018#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:14,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {23851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24022#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:14,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {23851#true} call #t~ret9 := main(); {23851#true} is VALID [2022-04-08 10:03:14,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23851#true} {23851#true} #50#return; {23851#true} is VALID [2022-04-08 10:03:14,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {23851#true} assume true; {23851#true} is VALID [2022-04-08 10:03:14,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {23851#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); {23851#true} is VALID [2022-04-08 10:03:14,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {23851#true} call ULTIMATE.init(); {23851#true} is VALID [2022-04-08 10:03:14,011 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:03:14,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253589223] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:14,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:14,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:14,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:14,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548070855] [2022-04-08 10:03:14,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548070855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:14,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:14,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426000804] [2022-04-08 10:03:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:14,012 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:14,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:14,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:14,029 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:03:14,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:14,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:14,030 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:15,381 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-08 10:03:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:03:15,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-08 10:03:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-08 10:03:15,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 57 transitions. [2022-04-08 10:03:15,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:15,411 INFO L225 Difference]: With dead ends: 65 [2022-04-08 10:03:15,411 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 10:03:15,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=600, Invalid=2480, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:03:15,412 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:15,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 97 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 10:03:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2022-04-08 10:03:15,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:15,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:15,575 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:15,575 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:15,575 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 10:03:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-08 10:03:15,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:15,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:15,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-08 10:03:15,599 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-08 10:03:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:15,600 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 10:03:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-08 10:03:15,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:15,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:15,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:15,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 10:03:15,601 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-08 10:03:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:15,601 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 10:03:15,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:15,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 10:03:15,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 10:03:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:15,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:15,827 INFO L499 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:15,843 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:03:16,043 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:03:16,043 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:16,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1926419829, now seen corresponding path program 91 times [2022-04-08 10:03:16,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:16,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2046592295] [2022-04-08 10:03:16,045 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:16,045 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1926419829, now seen corresponding path program 92 times [2022-04-08 10:03:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:16,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010162494] [2022-04-08 10:03:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {24437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {24417#true} is VALID [2022-04-08 10:03:16,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-08 10:03:16,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-08 10:03:16,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {24417#true} call ULTIMATE.init(); {24437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:16,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {24437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {24417#true} is VALID [2022-04-08 10:03:16,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-08 10:03:16,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-08 10:03:16,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {24417#true} call #t~ret9 := main(); {24417#true} is VALID [2022-04-08 10:03:16,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {24417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24422#(= main_~y~0 0)} is VALID [2022-04-08 10:03:16,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {24422#(= 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; {24423#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:16,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {24423#(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; {24424#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:16,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {24424#(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; {24425#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {24425#(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; {24426#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:16,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {24426#(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; {24427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:16,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {24427#(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; {24428#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:16,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {24428#(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; {24429#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:16,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {24429#(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; {24430#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:16,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {24430#(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; {24431#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:16,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {24431#(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; {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:16,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:16,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {24433#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:16,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {24433#(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; {24434#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:16,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {24434#(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; {24435#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:16,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {24435#(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; {24436#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:16,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {24436#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {24418#false} is VALID [2022-04-08 10:03:16,235 INFO L272 TraceCheckUtils]: 22: Hoare triple {24418#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24418#false} is VALID [2022-04-08 10:03:16,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {24418#false} ~cond := #in~cond; {24418#false} is VALID [2022-04-08 10:03:16,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {24418#false} assume 0 == ~cond; {24418#false} is VALID [2022-04-08 10:03:16,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {24418#false} assume !false; {24418#false} is VALID [2022-04-08 10:03:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:16,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010162494] [2022-04-08 10:03:16,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010162494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:16,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599900665] [2022-04-08 10:03:16,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:16,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:16,236 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:03:16,237 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:03:16,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:16,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:16,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:16,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {24417#true} call ULTIMATE.init(); {24417#true} is VALID [2022-04-08 10:03:16,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {24417#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); {24417#true} is VALID [2022-04-08 10:03:16,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-08 10:03:16,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-08 10:03:16,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {24417#true} call #t~ret9 := main(); {24417#true} is VALID [2022-04-08 10:03:16,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {24417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24422#(= main_~y~0 0)} is VALID [2022-04-08 10:03:16,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {24422#(= 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; {24423#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:16,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {24423#(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; {24424#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:16,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {24424#(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; {24425#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:16,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {24425#(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; {24426#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:16,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {24426#(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; {24427#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:16,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {24427#(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; {24428#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:16,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {24428#(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; {24429#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:16,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {24429#(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; {24430#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:16,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {24430#(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; {24431#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:16,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {24431#(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; {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:16,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:16,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {24432#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {24433#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:16,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {24433#(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; {24434#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:16,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {24434#(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; {24435#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:16,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {24435#(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; {24501#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:16,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {24501#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24418#false} is VALID [2022-04-08 10:03:16,444 INFO L272 TraceCheckUtils]: 22: Hoare triple {24418#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24418#false} is VALID [2022-04-08 10:03:16,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {24418#false} ~cond := #in~cond; {24418#false} is VALID [2022-04-08 10:03:16,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {24418#false} assume 0 == ~cond; {24418#false} is VALID [2022-04-08 10:03:16,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {24418#false} assume !false; {24418#false} is VALID [2022-04-08 10:03:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:16,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:16,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {24418#false} assume !false; {24418#false} is VALID [2022-04-08 10:03:16,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {24418#false} assume 0 == ~cond; {24418#false} is VALID [2022-04-08 10:03:16,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {24418#false} ~cond := #in~cond; {24418#false} is VALID [2022-04-08 10:03:16,722 INFO L272 TraceCheckUtils]: 22: Hoare triple {24418#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24418#false} is VALID [2022-04-08 10:03:16,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {24529#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24418#false} is VALID [2022-04-08 10:03:16,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {24533#(< 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; {24529#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:16,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {24537#(< 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; {24533#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:16,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {24541#(< 0 (mod (+ main_~z~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; {24537#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:16,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {24545#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {24541#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:16,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {24545#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {24545#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:16,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {24552#(< 0 (mod (+ main_~y~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; {24545#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:16,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {24556#(< 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; {24552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:16,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {24560#(< 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; {24556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:16,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {24564#(< 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; {24560#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:16,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {24568#(< 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; {24564#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:16,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {24572#(< 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; {24568#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:16,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {24576#(< 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; {24572#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:16,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {24580#(< 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; {24576#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:16,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {24584#(< 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; {24580#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:16,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {24588#(< 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; {24584#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:16,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {24417#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24588#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:16,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {24417#true} call #t~ret9 := main(); {24417#true} is VALID [2022-04-08 10:03:16,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24417#true} {24417#true} #50#return; {24417#true} is VALID [2022-04-08 10:03:16,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {24417#true} assume true; {24417#true} is VALID [2022-04-08 10:03:16,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {24417#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); {24417#true} is VALID [2022-04-08 10:03:16,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {24417#true} call ULTIMATE.init(); {24417#true} is VALID [2022-04-08 10:03:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:16,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599900665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:16,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:16,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:16,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:16,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2046592295] [2022-04-08 10:03:16,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2046592295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:16,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:16,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063858908] [2022-04-08 10:03:16,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:16,732 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:16,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:16,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:16,743 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:03:16,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:16,744 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:18,125 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-04-08 10:03:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:03:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-08 10:03:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-08 10:03:18,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 61 transitions. [2022-04-08 10:03:18,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:18,157 INFO L225 Difference]: With dead ends: 70 [2022-04-08 10:03:18,157 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 10:03:18,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:03:18,158 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:18,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 100 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 10:03:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2022-04-08 10:03:18,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:18,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,320 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,320 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:18,320 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-08 10:03:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-08 10:03:18,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:18,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:18,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 10:03:18,321 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 10:03:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:18,321 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-08 10:03:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-08 10:03:18,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:18,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:18,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:18,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 10:03:18,322 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-08 10:03:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:18,322 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 10:03:18,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:18,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 10:03:18,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 10:03:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:18,535 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:18,535 INFO L499 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:18,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-08 10:03:18,741 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:03:18,741 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:18,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1429921516, now seen corresponding path program 93 times [2022-04-08 10:03:18,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:18,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [91691675] [2022-04-08 10:03:18,743 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:18,743 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1429921516, now seen corresponding path program 94 times [2022-04-08 10:03:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:18,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733426471] [2022-04-08 10:03:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {25021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {25001#true} is VALID [2022-04-08 10:03:18,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-08 10:03:18,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-08 10:03:18,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:18,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {25021#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {25001#true} is VALID [2022-04-08 10:03:18,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-08 10:03:18,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-08 10:03:18,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret9 := main(); {25001#true} is VALID [2022-04-08 10:03:18,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {25001#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25006#(= main_~y~0 0)} is VALID [2022-04-08 10:03:18,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {25006#(= 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; {25007#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {25007#(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; {25008#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:18,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {25008#(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; {25009#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:18,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {25009#(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; {25010#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:18,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {25010#(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; {25011#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:18,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {25011#(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; {25012#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:18,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {25012#(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; {25013#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:18,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {25013#(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; {25014#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:18,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {25014#(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; {25015#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:18,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {25015#(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; {25016#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:18,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {25016#(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; {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:18,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:18,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {25018#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:18,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {25018#(and (<= main_~z~0 11) (<= 11 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; {25019#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:18,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {25019#(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; {25020#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:18,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {25020#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {25002#false} is VALID [2022-04-08 10:03:18,924 INFO L272 TraceCheckUtils]: 22: Hoare triple {25002#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25002#false} is VALID [2022-04-08 10:03:18,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {25002#false} ~cond := #in~cond; {25002#false} is VALID [2022-04-08 10:03:18,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {25002#false} assume 0 == ~cond; {25002#false} is VALID [2022-04-08 10:03:18,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-08 10:03:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:18,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733426471] [2022-04-08 10:03:18,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733426471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:18,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767636054] [2022-04-08 10:03:18,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:18,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:18,925 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:03:18,926 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:03:18,956 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:18,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:18,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:19,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25001#true} is VALID [2022-04-08 10:03:19,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {25001#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); {25001#true} is VALID [2022-04-08 10:03:19,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-08 10:03:19,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-08 10:03:19,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret9 := main(); {25001#true} is VALID [2022-04-08 10:03:19,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {25001#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25006#(= main_~y~0 0)} is VALID [2022-04-08 10:03:19,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {25006#(= 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; {25007#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:19,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {25007#(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; {25008#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:19,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {25008#(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; {25009#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:19,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {25009#(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; {25010#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:19,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {25010#(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; {25011#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:19,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {25011#(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; {25012#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:19,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {25012#(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; {25013#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:19,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {25013#(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; {25014#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:19,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {25014#(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; {25015#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:19,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {25015#(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; {25016#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:19,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {25016#(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; {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:19,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:19,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {25017#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {25018#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:19,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {25018#(and (<= main_~z~0 11) (<= 11 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; {25019#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:19,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {25019#(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; {25085#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:19,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {25085#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {25002#false} is VALID [2022-04-08 10:03:19,124 INFO L272 TraceCheckUtils]: 22: Hoare triple {25002#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25002#false} is VALID [2022-04-08 10:03:19,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {25002#false} ~cond := #in~cond; {25002#false} is VALID [2022-04-08 10:03:19,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {25002#false} assume 0 == ~cond; {25002#false} is VALID [2022-04-08 10:03:19,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-08 10:03:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:19,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:19,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {25002#false} assume !false; {25002#false} is VALID [2022-04-08 10:03:19,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {25002#false} assume 0 == ~cond; {25002#false} is VALID [2022-04-08 10:03:19,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {25002#false} ~cond := #in~cond; {25002#false} is VALID [2022-04-08 10:03:19,407 INFO L272 TraceCheckUtils]: 22: Hoare triple {25002#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25002#false} is VALID [2022-04-08 10:03:19,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {25113#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25002#false} is VALID [2022-04-08 10:03:19,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {25117#(< 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; {25113#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:19,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {25121#(< 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; {25117#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:19,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {25125#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {25121#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:19,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {25125#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25125#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:19,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {25132#(< 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; {25125#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:19,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {25136#(< 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; {25132#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:19,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {25140#(< 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; {25136#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:19,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {25144#(< 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; {25140#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:19,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {25148#(< 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; {25144#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:19,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {25152#(< 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; {25148#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:19,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {25156#(< 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; {25152#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:19,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {25160#(< 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; {25156#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:19,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {25164#(< 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; {25160#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:19,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {25168#(< 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; {25164#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:19,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {25172#(< 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; {25168#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:19,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {25001#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25172#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:19,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {25001#true} call #t~ret9 := main(); {25001#true} is VALID [2022-04-08 10:03:19,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25001#true} {25001#true} #50#return; {25001#true} is VALID [2022-04-08 10:03:19,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {25001#true} assume true; {25001#true} is VALID [2022-04-08 10:03:19,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {25001#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); {25001#true} is VALID [2022-04-08 10:03:19,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {25001#true} call ULTIMATE.init(); {25001#true} is VALID [2022-04-08 10:03:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:19,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767636054] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:19,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:19,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:19,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [91691675] [2022-04-08 10:03:19,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [91691675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:19,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:19,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209779702] [2022-04-08 10:03:19,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:19,416 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:19,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:19,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:19,426 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:03:19,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:19,427 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:20,792 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-04-08 10:03:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:03:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 63 transitions. [2022-04-08 10:03:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 63 transitions. [2022-04-08 10:03:20,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 63 transitions. [2022-04-08 10:03:20,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:20,828 INFO L225 Difference]: With dead ends: 74 [2022-04-08 10:03:20,828 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 10:03:20,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:03:20,828 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:20,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 100 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 10:03:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 40. [2022-04-08 10:03:20,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:20,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,993 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,993 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:20,993 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-04-08 10:03:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-04-08 10:03:20,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:20,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:20,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 10:03:20,994 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-08 10:03:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:20,998 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-04-08 10:03:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-04-08 10:03:20,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:20,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:20,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:20,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 10:03:20,999 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-08 10:03:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:20,999 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 10:03:20,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:20,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 10:03:21,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 10:03:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:21,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:21,274 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:21,290 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:03:21,490 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:03:21,490 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 845453931, now seen corresponding path program 95 times [2022-04-08 10:03:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:21,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716992274] [2022-04-08 10:03:21,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:21,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash 845453931, now seen corresponding path program 96 times [2022-04-08 10:03:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:21,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830418009] [2022-04-08 10:03:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:21,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {25615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {25595#true} is VALID [2022-04-08 10:03:21,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-08 10:03:21,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-08 10:03:21,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {25595#true} call ULTIMATE.init(); {25615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:21,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {25615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {25595#true} is VALID [2022-04-08 10:03:21,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-08 10:03:21,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-08 10:03:21,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {25595#true} call #t~ret9 := main(); {25595#true} is VALID [2022-04-08 10:03:21,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {25595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25600#(= main_~y~0 0)} is VALID [2022-04-08 10:03:21,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {25600#(= 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; {25601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:21,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {25601#(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; {25602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:21,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {25602#(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; {25603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:21,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {25603#(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; {25604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {25604#(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; {25605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:21,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {25605#(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; {25606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:21,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {25606#(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; {25607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:21,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {25607#(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; {25608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:21,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {25608#(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; {25609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:21,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {25609#(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; {25610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:21,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {25610#(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; {25611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:21,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {25611#(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; {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:21,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:21,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {25613#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:21,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {25613#(and (<= main_~z~0 12) (<= 12 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; {25614#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:21,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {25614#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {25596#false} is VALID [2022-04-08 10:03:21,676 INFO L272 TraceCheckUtils]: 22: Hoare triple {25596#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25596#false} is VALID [2022-04-08 10:03:21,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {25596#false} ~cond := #in~cond; {25596#false} is VALID [2022-04-08 10:03:21,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {25596#false} assume 0 == ~cond; {25596#false} is VALID [2022-04-08 10:03:21,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {25596#false} assume !false; {25596#false} is VALID [2022-04-08 10:03:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830418009] [2022-04-08 10:03:21,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830418009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694893998] [2022-04-08 10:03:21,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:21,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:21,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:21,677 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:03:21,678 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:03:21,739 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:03:21,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:21,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:21,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {25595#true} call ULTIMATE.init(); {25595#true} is VALID [2022-04-08 10:03:21,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {25595#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); {25595#true} is VALID [2022-04-08 10:03:21,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-08 10:03:21,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-08 10:03:21,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {25595#true} call #t~ret9 := main(); {25595#true} is VALID [2022-04-08 10:03:21,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {25595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25600#(= main_~y~0 0)} is VALID [2022-04-08 10:03:21,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {25600#(= 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; {25601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:21,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {25601#(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; {25602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:21,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {25602#(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; {25603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:21,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {25603#(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; {25604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {25604#(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; {25605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:21,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {25605#(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; {25606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:21,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {25606#(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; {25607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:21,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {25607#(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; {25608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:21,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {25608#(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; {25609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:21,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {25609#(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; {25610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:21,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {25610#(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; {25611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:21,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {25611#(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; {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:21,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:21,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {25612#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {25613#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:21,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {25613#(and (<= main_~z~0 12) (<= 12 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; {25679#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:21,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {25679#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {25596#false} is VALID [2022-04-08 10:03:21,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {25596#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25596#false} is VALID [2022-04-08 10:03:21,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {25596#false} ~cond := #in~cond; {25596#false} is VALID [2022-04-08 10:03:21,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {25596#false} assume 0 == ~cond; {25596#false} is VALID [2022-04-08 10:03:21,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {25596#false} assume !false; {25596#false} is VALID [2022-04-08 10:03:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:21,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:22,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {25596#false} assume !false; {25596#false} is VALID [2022-04-08 10:03:22,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {25596#false} assume 0 == ~cond; {25596#false} is VALID [2022-04-08 10:03:22,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {25596#false} ~cond := #in~cond; {25596#false} is VALID [2022-04-08 10:03:22,243 INFO L272 TraceCheckUtils]: 22: Hoare triple {25596#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25596#false} is VALID [2022-04-08 10:03:22,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {25707#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {25596#false} is VALID [2022-04-08 10:03:22,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {25711#(< 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; {25707#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:22,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {25715#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {25711#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:22,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {25715#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {25715#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:22,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {25722#(< 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; {25715#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:22,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {25726#(< 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; {25722#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:22,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {25730#(< 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; {25726#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:22,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {25734#(< 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; {25730#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:22,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {25738#(< 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; {25734#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:22,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {25742#(< 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; {25738#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:22,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {25746#(< 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; {25742#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:22,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {25750#(< 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; {25746#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:22,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {25754#(< 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; {25750#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:22,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {25758#(< 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; {25754#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:22,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {25762#(< 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; {25758#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:22,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {25766#(< 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; {25762#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:22,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {25595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25766#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:03:22,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {25595#true} call #t~ret9 := main(); {25595#true} is VALID [2022-04-08 10:03:22,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25595#true} {25595#true} #50#return; {25595#true} is VALID [2022-04-08 10:03:22,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {25595#true} assume true; {25595#true} is VALID [2022-04-08 10:03:22,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {25595#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); {25595#true} is VALID [2022-04-08 10:03:22,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {25595#true} call ULTIMATE.init(); {25595#true} is VALID [2022-04-08 10:03:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:22,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694893998] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:22,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:22,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:22,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:22,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716992274] [2022-04-08 10:03:22,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716992274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:22,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:22,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:22,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723797912] [2022-04-08 10:03:22,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:22,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:22,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:22,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:22,275 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:03:22,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:22,276 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:23,928 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-08 10:03:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:03:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-08 10:03:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-04-08 10:03:23,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-04-08 10:03:23,968 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:03:23,969 INFO L225 Difference]: With dead ends: 77 [2022-04-08 10:03:23,969 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 10:03:23,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:03:23,970 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:23,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 105 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 10:03:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2022-04-08 10:03:24,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:24,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,127 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,127 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:24,128 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-08 10:03:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-04-08 10:03:24,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:24,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:24,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 10:03:24,128 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-08 10:03:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:24,132 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-08 10:03:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-04-08 10:03:24,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:24,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:24,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:24,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-08 10:03:24,132 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 26 [2022-04-08 10:03:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:24,133 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-08 10:03:24,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:24,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-08 10:03:24,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-08 10:03:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:24,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:24,358 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:24,376 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:03:24,562 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:03:24,563 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1251609844, now seen corresponding path program 25 times [2022-04-08 10:03:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:24,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922462551] [2022-04-08 10:03:24,565 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:24,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1251609844, now seen corresponding path program 26 times [2022-04-08 10:03:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:24,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088977047] [2022-04-08 10:03:24,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:24,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {26217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {26197#true} is VALID [2022-04-08 10:03:24,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-08 10:03:24,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-08 10:03:24,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {26197#true} call ULTIMATE.init(); {26217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:24,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {26217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {26197#true} is VALID [2022-04-08 10:03:24,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-08 10:03:24,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-08 10:03:24,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {26197#true} call #t~ret9 := main(); {26197#true} is VALID [2022-04-08 10:03:24,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {26197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26202#(= main_~y~0 0)} is VALID [2022-04-08 10:03:24,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {26202#(= 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; {26203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:24,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {26203#(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; {26204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:24,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {26204#(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; {26205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:24,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {26205#(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; {26206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:24,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {26206#(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; {26207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:24,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {26207#(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; {26208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:24,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {26208#(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; {26209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:24,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {26209#(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; {26210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:24,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {26210#(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; {26211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:24,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {26211#(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; {26212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:24,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {26212#(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; {26213#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:24,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {26213#(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; {26214#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:24,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {26214#(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; {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:24,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:24,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {26216#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:24,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {26216#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26198#false} is VALID [2022-04-08 10:03:24,799 INFO L272 TraceCheckUtils]: 22: Hoare triple {26198#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26198#false} is VALID [2022-04-08 10:03:24,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {26198#false} ~cond := #in~cond; {26198#false} is VALID [2022-04-08 10:03:24,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {26198#false} assume 0 == ~cond; {26198#false} is VALID [2022-04-08 10:03:24,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {26198#false} assume !false; {26198#false} is VALID [2022-04-08 10:03:24,799 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:03:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:24,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088977047] [2022-04-08 10:03:24,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088977047] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:24,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145190738] [2022-04-08 10:03:24,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:24,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:24,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:24,800 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:03:24,816 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:03:24,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:24,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:24,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:03:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:24,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:25,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {26197#true} call ULTIMATE.init(); {26197#true} is VALID [2022-04-08 10:03:25,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {26197#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); {26197#true} is VALID [2022-04-08 10:03:25,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-08 10:03:25,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-08 10:03:25,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {26197#true} call #t~ret9 := main(); {26197#true} is VALID [2022-04-08 10:03:25,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {26197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26202#(= main_~y~0 0)} is VALID [2022-04-08 10:03:25,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {26202#(= 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; {26203#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:25,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {26203#(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; {26204#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:25,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {26204#(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; {26205#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:25,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {26205#(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; {26206#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:25,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {26206#(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; {26207#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:25,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {26207#(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; {26208#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:25,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {26208#(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; {26209#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:25,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {26209#(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; {26210#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:25,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {26210#(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; {26211#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:25,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {26211#(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; {26212#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:25,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {26212#(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; {26213#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:25,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {26213#(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; {26214#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:25,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {26214#(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; {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:25,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:25,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {26215#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {26281#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:03:25,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {26281#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {26198#false} is VALID [2022-04-08 10:03:25,147 INFO L272 TraceCheckUtils]: 22: Hoare triple {26198#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26198#false} is VALID [2022-04-08 10:03:25,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {26198#false} ~cond := #in~cond; {26198#false} is VALID [2022-04-08 10:03:25,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {26198#false} assume 0 == ~cond; {26198#false} is VALID [2022-04-08 10:03:25,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {26198#false} assume !false; {26198#false} is VALID [2022-04-08 10:03:25,147 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:03:25,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:25,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {26198#false} assume !false; {26198#false} is VALID [2022-04-08 10:03:25,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {26198#false} assume 0 == ~cond; {26198#false} is VALID [2022-04-08 10:03:25,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {26198#false} ~cond := #in~cond; {26198#false} is VALID [2022-04-08 10:03:25,512 INFO L272 TraceCheckUtils]: 22: Hoare triple {26198#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26198#false} is VALID [2022-04-08 10:03:25,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {26309#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {26198#false} is VALID [2022-04-08 10:03:25,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {26313#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {26309#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:25,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {26313#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {26313#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:25,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {26320#(< 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; {26313#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:25,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {26324#(< 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; {26320#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:25,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {26328#(< 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; {26324#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:25,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {26332#(< 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; {26328#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:25,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {26336#(< 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; {26332#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:25,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {26340#(< 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; {26336#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:25,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {26344#(< 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; {26340#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:25,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {26348#(< 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; {26344#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:25,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {26352#(< 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; {26348#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:25,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {26356#(< 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; {26352#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:25,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {26360#(< 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; {26356#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:25,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {26364#(< 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; {26360#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:03:25,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {26368#(< 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; {26364#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:03:25,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {26197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26368#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:03:25,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {26197#true} call #t~ret9 := main(); {26197#true} is VALID [2022-04-08 10:03:25,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26197#true} {26197#true} #50#return; {26197#true} is VALID [2022-04-08 10:03:25,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {26197#true} assume true; {26197#true} is VALID [2022-04-08 10:03:25,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {26197#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); {26197#true} is VALID [2022-04-08 10:03:25,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {26197#true} call ULTIMATE.init(); {26197#true} is VALID [2022-04-08 10:03:25,520 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:03:25,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145190738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:25,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:25,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:03:25,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:25,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922462551] [2022-04-08 10:03:25,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922462551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:25,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:25,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:03:25,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895239771] [2022-04-08 10:03:25,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:25,521 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:25,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:25,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:25,531 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:03:25,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:03:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:03:25,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:25,531 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:27,318 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-04-08 10:03:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:03:27,319 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2022-04-08 10:03:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 70 transitions. [2022-04-08 10:03:27,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 70 transitions. [2022-04-08 10:03:27,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:27,355 INFO L225 Difference]: With dead ends: 82 [2022-04-08 10:03:27,355 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 10:03:27,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 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:03:27,356 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:27,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:03:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 10:03:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2022-04-08 10:03:27,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:27,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:27,531 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:27,531 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:27,531 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2022-04-08 10:03:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2022-04-08 10:03:27,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:27,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:27,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-08 10:03:27,532 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-08 10:03:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:27,534 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2022-04-08 10:03:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2022-04-08 10:03:27,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:27,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:27,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:27,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-08 10:03:27,535 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 26 [2022-04-08 10:03:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:27,535 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-08 10:03:27,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 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:03:27,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-08 10:03:27,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-08 10:03:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:27,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:27,777 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:27,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:27,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:27,991 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -992485066, now seen corresponding path program 97 times [2022-04-08 10:03:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:27,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772502448] [2022-04-08 10:03:27,994 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:27,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -992485066, now seen corresponding path program 98 times [2022-04-08 10:03:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:27,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449750825] [2022-04-08 10:03:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:28,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:28,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {26844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {26821#true} is VALID [2022-04-08 10:03:28,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-08 10:03:28,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-08 10:03:28,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {26821#true} call ULTIMATE.init(); {26844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:28,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {26844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {26821#true} is VALID [2022-04-08 10:03:28,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-08 10:03:28,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-08 10:03:28,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {26821#true} call #t~ret9 := main(); {26821#true} is VALID [2022-04-08 10:03:28,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {26821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:03:28,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26827#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:03:28,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {26827#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {26828#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:03:28,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {26828#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~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; {26829#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:03:28,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {26829#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= 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; {26830#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:03:28,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {26830#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26831#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:03:28,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {26831#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= 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; {26832#(and (<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:03:28,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {26832#(and (<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26833#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:03:28,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {26833#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {26834#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:03:28,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {26834#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} ~z~0 := ~y~0; {26834#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:03:28,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {26834#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) main_~x~0) (<= main_~n~0 (+ 7 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; {26835#(and (<= (+ (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:03:28,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {26835#(and (<= (+ (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~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; {26836#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 main_~x~0)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} is VALID [2022-04-08 10:03:28,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {26836#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 main_~x~0)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 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; {26837#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:03:28,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {26837#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 3) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~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; {26838#(and (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:03:28,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {26838#(and (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 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; {26839#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:03:28,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {26839#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~n~0 (+ main_~x~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; {26840#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:03:28,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {26840#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~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; {26841#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:03:28,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {26841#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {26841#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:03:28,654 INFO L272 TraceCheckUtils]: 23: Hoare triple {26841#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26842#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:28,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {26842#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26843#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:28,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {26843#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26822#false} is VALID [2022-04-08 10:03:28,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#false} assume !false; {26822#false} is VALID [2022-04-08 10:03:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449750825] [2022-04-08 10:03:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449750825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:28,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146518410] [2022-04-08 10:03:28,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:28,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:28,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:28,657 INFO L229 MonitoredProcess]: Starting monitored process 63 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:03:28,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-08 10:03:28,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:28,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:28,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:28,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:28,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {26821#true} call ULTIMATE.init(); {26821#true} is VALID [2022-04-08 10:03:28,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {26821#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); {26821#true} is VALID [2022-04-08 10:03:28,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-08 10:03:28,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-08 10:03:28,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {26821#true} call #t~ret9 := main(); {26821#true} is VALID [2022-04-08 10:03:28,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {26821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:03:28,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26866#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:03:28,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {26866#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26870#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-08 10:03:28,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {26870#(= (+ main_~x~0 2 (* (- 1) main_~n~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; {26874#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:03:28,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {26874#(= (+ (- 2) main_~n~0) (+ main_~x~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; {26878#(= (+ (- 2) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:03:28,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {26878#(= (+ (- 2) main_~n~0) (+ main_~x~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; {26882#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} is VALID [2022-04-08 10:03:28,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {26882#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26886#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:03:28,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {26886#(= (+ main_~x~0 1) (+ main_~n~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; {26890#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:03:28,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {26890#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} assume !(~x~0 % 4294967296 > 0); {26890#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:03:28,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {26890#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} ~z~0 := ~y~0; {26890#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:03:28,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {26890#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26886#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:03:28,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {26886#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26882#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} is VALID [2022-04-08 10:03:28,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {26882#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26878#(= (+ (- 2) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:03:28,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {26878#(= (+ (- 2) main_~n~0) (+ main_~x~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; {26874#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:03:28,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {26874#(= (+ (- 2) main_~n~0) (+ main_~x~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; {26870#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0)} is VALID [2022-04-08 10:03:28,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {26870#(= (+ main_~x~0 2 (* (- 1) main_~n~0)) 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; {26866#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:03:28,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {26866#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 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; {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:03:28,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:03:28,931 INFO L272 TraceCheckUtils]: 23: Hoare triple {26826#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:28,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:28,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {26928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26822#false} is VALID [2022-04-08 10:03:28,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#false} assume !false; {26822#false} is VALID [2022-04-08 10:03:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:28,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:29,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#false} assume !false; {26822#false} is VALID [2022-04-08 10:03:29,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {26928#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26822#false} is VALID [2022-04-08 10:03:29,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {26924#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26928#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:29,402 INFO L272 TraceCheckUtils]: 23: Hoare triple {26944#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26924#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:29,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {26944#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {26944#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:03:29,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {26951#(= (mod main_~n~0 4294967296) (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; {26944#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:03:29,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {26955#(= (mod main_~n~0 4294967296) (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; {26951#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:03:29,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {26959#(= (mod (+ main_~x~0 3) 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; {26955#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:03:29,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {26963#(= (mod main_~n~0 4294967296) (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; {26959#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:03:29,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {26967#(= (mod main_~n~0 4294967296) (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; {26963#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:03:29,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {26971#(= (mod main_~n~0 4294967296) (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; {26967#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:03:29,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {26975#(= (mod main_~n~0 4294967296) (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; {26971#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:03:29,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {26975#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} ~z~0 := ~y~0; {26975#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:03:29,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {26975#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {26975#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:03:29,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {26971#(= (mod main_~n~0 4294967296) (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; {26975#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:03:29,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {26967#(= (mod main_~n~0 4294967296) (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; {26971#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:03:29,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {26963#(= (mod main_~n~0 4294967296) (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; {26967#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:03:29,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {26959#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~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; {26963#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:03:29,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {26955#(= (mod main_~n~0 4294967296) (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; {26959#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:03:29,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {26951#(= (mod main_~n~0 4294967296) (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; {26955#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:03:29,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {26944#(= (mod main_~n~0 4294967296) (mod 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; {26951#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:03:29,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {26821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26944#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:03:29,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {26821#true} call #t~ret9 := main(); {26821#true} is VALID [2022-04-08 10:03:29,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26821#true} {26821#true} #50#return; {26821#true} is VALID [2022-04-08 10:03:29,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {26821#true} assume true; {26821#true} is VALID [2022-04-08 10:03:29,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {26821#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); {26821#true} is VALID [2022-04-08 10:03:29,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {26821#true} call ULTIMATE.init(); {26821#true} is VALID [2022-04-08 10:03:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:29,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146518410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:29,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:29,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 38 [2022-04-08 10:03:29,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:29,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772502448] [2022-04-08 10:03:29,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772502448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:29,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:29,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:03:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369249731] [2022-04-08 10:03:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:29,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:29,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:29,435 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:03:29,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:03:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:03:29,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:03:29,437 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,076 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 10:03:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:03:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-08 10:03:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2022-04-08 10:03:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 38 transitions. [2022-04-08 10:03:31,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 38 transitions. [2022-04-08 10:03:31,106 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:03:31,106 INFO L225 Difference]: With dead ends: 54 [2022-04-08 10:03:31,106 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 10:03:31,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:03:31,107 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:31,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:03:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 10:03:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-04-08 10:03:31,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:31,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,402 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,402 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,403 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-08 10:03:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 10:03:31,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:31,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:31,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 10:03:31,403 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-08 10:03:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,403 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-08 10:03:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-08 10:03:31,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:31,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:31,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:31,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:03:31,409 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-08 10:03:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:31,409 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:03:31,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:31,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:03:31,722 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:03:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:03:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:31,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:31,723 INFO L499 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:31,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:31,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:31,923 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1404928745, now seen corresponding path program 99 times [2022-04-08 10:03:31,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:31,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409490785] [2022-04-08 10:03:31,927 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:31,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1404928745, now seen corresponding path program 100 times [2022-04-08 10:03:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:31,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403113670] [2022-04-08 10:03:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:32,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:32,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {27370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {27349#true} is VALID [2022-04-08 10:03:32,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-08 10:03:32,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-08 10:03:32,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {27349#true} call ULTIMATE.init(); {27370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:32,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {27370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {27349#true} is VALID [2022-04-08 10:03:32,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-08 10:03:32,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-08 10:03:32,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {27349#true} call #t~ret9 := main(); {27349#true} is VALID [2022-04-08 10:03:32,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {27349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27354#(= main_~y~0 0)} is VALID [2022-04-08 10:03:32,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {27354#(= 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; {27355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:32,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {27355#(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; {27356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {27356#(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; {27357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:32,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {27357#(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; {27358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {27358#(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; {27359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:32,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {27359#(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; {27360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:32,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {27360#(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; {27361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:32,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {27361#(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; {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:32,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:32,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27363#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:32,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {27363#(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; {27364#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:32,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {27364#(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; {27365#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:32,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {27365#(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; {27366#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:32,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {27366#(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; {27367#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:32,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {27367#(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; {27368#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:32,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {27368#(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; {27369#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:32,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {27369#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27350#false} is VALID [2022-04-08 10:03:32,189 INFO L272 TraceCheckUtils]: 23: Hoare triple {27350#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27350#false} is VALID [2022-04-08 10:03:32,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {27350#false} ~cond := #in~cond; {27350#false} is VALID [2022-04-08 10:03:32,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {27350#false} assume 0 == ~cond; {27350#false} is VALID [2022-04-08 10:03:32,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {27350#false} assume !false; {27350#false} is VALID [2022-04-08 10:03:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:32,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403113670] [2022-04-08 10:03:32,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403113670] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:32,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681679500] [2022-04-08 10:03:32,190 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:32,190 INFO L229 MonitoredProcess]: Starting monitored process 64 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:03:32,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-08 10:03:32,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:32,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:32,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:32,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:32,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {27349#true} call ULTIMATE.init(); {27349#true} is VALID [2022-04-08 10:03:32,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {27349#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); {27349#true} is VALID [2022-04-08 10:03:32,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-08 10:03:32,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-08 10:03:32,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {27349#true} call #t~ret9 := main(); {27349#true} is VALID [2022-04-08 10:03:32,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {27349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27354#(= main_~y~0 0)} is VALID [2022-04-08 10:03:32,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {27354#(= 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; {27355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:32,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {27355#(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; {27356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {27356#(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; {27357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:32,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {27357#(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; {27358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:32,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {27358#(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; {27359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:32,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {27359#(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; {27360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:32,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {27360#(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; {27361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:32,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {27361#(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; {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:32,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:32,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {27362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27363#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:32,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {27363#(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; {27364#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:32,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {27364#(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; {27365#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:32,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {27365#(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; {27366#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:32,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {27366#(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; {27367#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:32,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {27367#(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; {27368#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:32,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {27368#(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; {27437#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:32,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {27437#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27350#false} is VALID [2022-04-08 10:03:32,505 INFO L272 TraceCheckUtils]: 23: Hoare triple {27350#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27350#false} is VALID [2022-04-08 10:03:32,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {27350#false} ~cond := #in~cond; {27350#false} is VALID [2022-04-08 10:03:32,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {27350#false} assume 0 == ~cond; {27350#false} is VALID [2022-04-08 10:03:32,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {27350#false} assume !false; {27350#false} is VALID [2022-04-08 10:03:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:32,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:32,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {27350#false} assume !false; {27350#false} is VALID [2022-04-08 10:03:32,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {27350#false} assume 0 == ~cond; {27350#false} is VALID [2022-04-08 10:03:32,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {27350#false} ~cond := #in~cond; {27350#false} is VALID [2022-04-08 10:03:32,859 INFO L272 TraceCheckUtils]: 23: Hoare triple {27350#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27350#false} is VALID [2022-04-08 10:03:32,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {27465#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27350#false} is VALID [2022-04-08 10:03:32,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {27469#(< 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; {27465#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:32,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {27473#(< 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; {27469#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:32,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {27477#(< 0 (mod (+ main_~z~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; {27473#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:32,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {27481#(< 0 (mod (+ 4294967292 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; {27477#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:32,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {27485#(< 0 (mod (+ 4294967291 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; {27481#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:32,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {27489#(< 0 (mod (+ 4294967290 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; {27485#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:32,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {27493#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {27489#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:32,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {27493#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {27493#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:32,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {27500#(< 0 (mod (+ 4294967291 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; {27493#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:32,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {27504#(< 0 (mod (+ 4294967292 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; {27500#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:32,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {27508#(< 0 (mod (+ main_~y~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; {27504#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:32,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {27512#(< 0 (mod (+ main_~y~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; {27508#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:32,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {27516#(< 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; {27512#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:32,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {27520#(< 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; {27516#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:32,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {27524#(< 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; {27520#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:32,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {27528#(< 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; {27524#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:32,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {27349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27528#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:32,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {27349#true} call #t~ret9 := main(); {27349#true} is VALID [2022-04-08 10:03:32,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27349#true} {27349#true} #50#return; {27349#true} is VALID [2022-04-08 10:03:32,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {27349#true} assume true; {27349#true} is VALID [2022-04-08 10:03:32,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {27349#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); {27349#true} is VALID [2022-04-08 10:03:32,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {27349#true} call ULTIMATE.init(); {27349#true} is VALID [2022-04-08 10:03:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:32,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681679500] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:32,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:32,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:03:32,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:32,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409490785] [2022-04-08 10:03:32,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409490785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:32,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:32,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52968822] [2022-04-08 10:03:32,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:32,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:32,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:32,921 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:03:32,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:32,922 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:34,582 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-08 10:03:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:03:34,582 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2022-04-08 10:03:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2022-04-08 10:03:34,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 52 transitions. [2022-04-08 10:03:34,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:34,611 INFO L225 Difference]: With dead ends: 64 [2022-04-08 10:03:34,611 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 10:03:34,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=596, Invalid=2710, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:03:34,611 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:34,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 74 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 10:03:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2022-04-08 10:03:34,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:34,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:34,817 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:34,817 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:34,817 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 10:03:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 10:03:34,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:34,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:34,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 59 states. [2022-04-08 10:03:34,818 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 59 states. [2022-04-08 10:03:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:34,829 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 10:03:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 10:03:34,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:34,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:34,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:34,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:03:34,830 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-08 10:03:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:34,830 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:03:34,830 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:34,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:03:35,186 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:03:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:03:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:35,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:35,187 INFO L499 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:35,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:35,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-08 10:03:35,397 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:35,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:35,397 INFO L85 PathProgramCache]: Analyzing trace with hash 521429270, now seen corresponding path program 101 times [2022-04-08 10:03:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:35,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944316576] [2022-04-08 10:03:35,400 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:35,400 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash 521429270, now seen corresponding path program 102 times [2022-04-08 10:03:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:35,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658167583] [2022-04-08 10:03:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:35,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {27946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {27925#true} is VALID [2022-04-08 10:03:35,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-08 10:03:35,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-08 10:03:35,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {27925#true} call ULTIMATE.init(); {27946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:35,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {27946#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {27925#true} is VALID [2022-04-08 10:03:35,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-08 10:03:35,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-08 10:03:35,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {27925#true} call #t~ret9 := main(); {27925#true} is VALID [2022-04-08 10:03:35,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {27925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27930#(= main_~y~0 0)} is VALID [2022-04-08 10:03:35,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {27930#(= 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; {27931#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:35,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {27931#(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; {27932#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:35,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {27932#(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; {27933#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:35,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {27933#(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; {27934#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:35,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {27934#(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; {27935#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:35,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {27935#(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; {27936#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:35,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {27936#(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; {27937#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:35,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {27937#(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; {27938#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:35,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {27938#(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; {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:35,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:35,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {27940#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:35,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {27940#(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; {27941#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:35,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {27941#(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; {27942#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:35,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {27942#(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; {27943#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:35,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {27943#(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; {27944#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:35,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {27944#(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; {27945#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:35,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {27945#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {27926#false} is VALID [2022-04-08 10:03:35,642 INFO L272 TraceCheckUtils]: 23: Hoare triple {27926#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27926#false} is VALID [2022-04-08 10:03:35,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {27926#false} ~cond := #in~cond; {27926#false} is VALID [2022-04-08 10:03:35,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {27926#false} assume 0 == ~cond; {27926#false} is VALID [2022-04-08 10:03:35,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {27926#false} assume !false; {27926#false} is VALID [2022-04-08 10:03:35,642 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:03:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:35,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658167583] [2022-04-08 10:03:35,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658167583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:35,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043478219] [2022-04-08 10:03:35,643 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:35,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:35,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:35,644 INFO L229 MonitoredProcess]: Starting monitored process 65 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:03:35,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-08 10:03:35,725 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:03:35,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:35,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:35,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:35,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {27925#true} call ULTIMATE.init(); {27925#true} is VALID [2022-04-08 10:03:35,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {27925#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); {27925#true} is VALID [2022-04-08 10:03:35,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-08 10:03:35,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-08 10:03:35,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {27925#true} call #t~ret9 := main(); {27925#true} is VALID [2022-04-08 10:03:35,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {27925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27930#(= main_~y~0 0)} is VALID [2022-04-08 10:03:35,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {27930#(= 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; {27931#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:35,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {27931#(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; {27932#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:35,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {27932#(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; {27933#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:35,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {27933#(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; {27934#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:35,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {27934#(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; {27935#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:35,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {27935#(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; {27936#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:35,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {27936#(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; {27937#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:35,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {27937#(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; {27938#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:35,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {27938#(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; {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:35,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:35,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {27939#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {27940#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:35,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {27940#(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; {27941#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:35,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {27941#(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; {27942#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:35,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {27942#(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; {27943#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:35,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {27943#(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; {27944#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:35,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {27944#(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; {28013#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:35,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {28013#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {27926#false} is VALID [2022-04-08 10:03:35,903 INFO L272 TraceCheckUtils]: 23: Hoare triple {27926#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27926#false} is VALID [2022-04-08 10:03:35,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {27926#false} ~cond := #in~cond; {27926#false} is VALID [2022-04-08 10:03:35,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {27926#false} assume 0 == ~cond; {27926#false} is VALID [2022-04-08 10:03:35,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {27926#false} assume !false; {27926#false} is VALID [2022-04-08 10:03:35,903 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:03:35,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:36,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {27926#false} assume !false; {27926#false} is VALID [2022-04-08 10:03:36,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {27926#false} assume 0 == ~cond; {27926#false} is VALID [2022-04-08 10:03:36,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {27926#false} ~cond := #in~cond; {27926#false} is VALID [2022-04-08 10:03:36,268 INFO L272 TraceCheckUtils]: 23: Hoare triple {27926#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27926#false} is VALID [2022-04-08 10:03:36,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {28041#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27926#false} is VALID [2022-04-08 10:03:36,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {28045#(< 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; {28041#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:36,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {28049#(< 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; {28045#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:36,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {28053#(< 0 (mod (+ main_~z~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; {28049#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:36,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {28057#(< 0 (mod (+ 4294967292 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; {28053#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:36,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {28061#(< 0 (mod (+ 4294967291 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; {28057#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:36,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {28065#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {28061#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:36,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {28065#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28065#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:36,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {28072#(< 0 (mod (+ 4294967292 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; {28065#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:36,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {28076#(< 0 (mod (+ main_~y~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; {28072#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:36,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {28080#(< 0 (mod (+ main_~y~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; {28076#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:36,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {28084#(< 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; {28080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:36,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {28088#(< 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; {28084#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:36,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {28092#(< 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; {28088#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:36,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {28096#(< 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; {28092#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:36,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {28100#(< 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; {28096#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:36,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {28104#(< 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; {28100#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:36,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {27925#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28104#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:36,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {27925#true} call #t~ret9 := main(); {27925#true} is VALID [2022-04-08 10:03:36,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27925#true} {27925#true} #50#return; {27925#true} is VALID [2022-04-08 10:03:36,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {27925#true} assume true; {27925#true} is VALID [2022-04-08 10:03:36,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {27925#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); {27925#true} is VALID [2022-04-08 10:03:36,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {27925#true} call ULTIMATE.init(); {27925#true} is VALID [2022-04-08 10:03:36,278 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:03:36,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043478219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:36,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:36,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:03:36,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:36,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944316576] [2022-04-08 10:03:36,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944316576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:36,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:36,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:36,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021449054] [2022-04-08 10:03:36,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:36,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:36,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:36,294 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:03:36,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:36,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:36,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:36,295 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:38,142 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-08 10:03:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:03:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2022-04-08 10:03:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2022-04-08 10:03:38,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 60 transitions. [2022-04-08 10:03:38,181 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:03:38,182 INFO L225 Difference]: With dead ends: 71 [2022-04-08 10:03:38,182 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 10:03:38,182 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=686, Invalid=2974, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:03:38,182 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:38,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 87 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 10:03:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2022-04-08 10:03:38,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:38,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,430 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,430 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:38,431 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-08 10:03:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 10:03:38,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:38,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:38,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 66 states. [2022-04-08 10:03:38,432 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 66 states. [2022-04-08 10:03:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:38,432 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-08 10:03:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 10:03:38,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:38,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:38,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:38,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:03:38,433 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-08 10:03:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:38,433 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:03:38,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:38,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:03:39,033 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:03:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:03:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:39,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:39,034 INFO L499 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:39,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:39,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:39,238 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:39,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash 445022519, now seen corresponding path program 103 times [2022-04-08 10:03:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:39,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1104485323] [2022-04-08 10:03:39,241 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:39,241 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash 445022519, now seen corresponding path program 104 times [2022-04-08 10:03:39,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:39,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599048557] [2022-04-08 10:03:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:39,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {28556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {28535#true} is VALID [2022-04-08 10:03:39,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-08 10:03:39,566 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-08 10:03:39,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {28535#true} call ULTIMATE.init(); {28556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:39,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {28556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {28535#true} is VALID [2022-04-08 10:03:39,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-08 10:03:39,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-08 10:03:39,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret9 := main(); {28535#true} is VALID [2022-04-08 10:03:39,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {28535#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28540#(= main_~y~0 0)} is VALID [2022-04-08 10:03:39,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {28540#(= 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; {28541#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:39,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {28541#(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; {28542#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:39,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {28542#(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; {28543#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:39,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {28543#(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; {28544#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:39,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {28544#(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; {28545#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {28545#(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; {28546#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:39,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {28546#(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; {28547#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:39,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {28547#(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; {28548#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:39,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {28548#(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; {28549#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:39,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {28549#(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; {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:39,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:39,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {28551#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:39,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {28551#(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; {28552#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:39,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {28552#(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; {28553#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:39,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {28553#(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; {28554#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:39,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {28554#(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; {28555#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:39,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {28555#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {28536#false} is VALID [2022-04-08 10:03:39,575 INFO L272 TraceCheckUtils]: 23: Hoare triple {28536#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28536#false} is VALID [2022-04-08 10:03:39,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {28536#false} ~cond := #in~cond; {28536#false} is VALID [2022-04-08 10:03:39,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {28536#false} assume 0 == ~cond; {28536#false} is VALID [2022-04-08 10:03:39,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2022-04-08 10:03:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:39,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:39,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599048557] [2022-04-08 10:03:39,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599048557] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:39,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965848459] [2022-04-08 10:03:39,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:39,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:39,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:39,579 INFO L229 MonitoredProcess]: Starting monitored process 66 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:03:39,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-08 10:03:39,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:39,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:39,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:39,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:39,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {28535#true} call ULTIMATE.init(); {28535#true} is VALID [2022-04-08 10:03:39,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {28535#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); {28535#true} is VALID [2022-04-08 10:03:39,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-08 10:03:39,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-08 10:03:39,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret9 := main(); {28535#true} is VALID [2022-04-08 10:03:39,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {28535#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28540#(= main_~y~0 0)} is VALID [2022-04-08 10:03:39,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {28540#(= 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; {28541#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:39,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {28541#(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; {28542#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:39,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {28542#(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; {28543#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:39,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {28543#(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; {28544#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:39,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {28544#(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; {28545#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:39,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {28545#(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; {28546#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:39,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {28546#(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; {28547#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:39,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {28547#(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; {28548#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:39,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {28548#(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; {28549#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:39,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {28549#(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; {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:39,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:39,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {28550#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {28551#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:39,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {28551#(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; {28552#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:39,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {28552#(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; {28553#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:39,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {28553#(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; {28554#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:39,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {28554#(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; {28623#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:39,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {28623#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {28536#false} is VALID [2022-04-08 10:03:39,952 INFO L272 TraceCheckUtils]: 23: Hoare triple {28536#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28536#false} is VALID [2022-04-08 10:03:39,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {28536#false} ~cond := #in~cond; {28536#false} is VALID [2022-04-08 10:03:39,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {28536#false} assume 0 == ~cond; {28536#false} is VALID [2022-04-08 10:03:39,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2022-04-08 10:03:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:39,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:40,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2022-04-08 10:03:40,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {28536#false} assume 0 == ~cond; {28536#false} is VALID [2022-04-08 10:03:40,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {28536#false} ~cond := #in~cond; {28536#false} is VALID [2022-04-08 10:03:40,342 INFO L272 TraceCheckUtils]: 23: Hoare triple {28536#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28536#false} is VALID [2022-04-08 10:03:40,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {28651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {28536#false} is VALID [2022-04-08 10:03:40,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {28655#(< 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; {28651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:40,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {28659#(< 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; {28655#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:40,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {28663#(< 0 (mod (+ main_~z~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; {28659#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:40,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {28667#(< 0 (mod (+ 4294967292 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; {28663#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:40,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {28671#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {28667#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:03:40,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {28671#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28671#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:40,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {28678#(< 0 (mod (+ main_~y~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; {28671#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:40,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {28682#(< 0 (mod (+ main_~y~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; {28678#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:40,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {28686#(< 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; {28682#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:40,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {28690#(< 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; {28686#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:40,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {28694#(< 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; {28690#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:40,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {28698#(< 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; {28694#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:40,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {28702#(< 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; {28698#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:40,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {28706#(< 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; {28702#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:40,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {28710#(< 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; {28706#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:40,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {28714#(< 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; {28710#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:40,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {28535#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28714#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:40,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret9 := main(); {28535#true} is VALID [2022-04-08 10:03:40,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #50#return; {28535#true} is VALID [2022-04-08 10:03:40,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2022-04-08 10:03:40,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {28535#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); {28535#true} is VALID [2022-04-08 10:03:40,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {28535#true} call ULTIMATE.init(); {28535#true} is VALID [2022-04-08 10:03:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:40,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965848459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:40,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:40,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:03:40,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:40,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1104485323] [2022-04-08 10:03:40,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1104485323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:40,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:40,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122350877] [2022-04-08 10:03:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:40,352 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:40,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:40,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:40,363 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:03:40,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:40,364 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:42,059 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-08 10:03:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:03:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. [2022-04-08 10:03:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 65 transitions. [2022-04-08 10:03:42,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 65 transitions. [2022-04-08 10:03:42,109 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:03:42,110 INFO L225 Difference]: With dead ends: 77 [2022-04-08 10:03:42,110 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 10:03:42,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=708, Invalid=2952, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:03:42,110 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:42,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 85 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 10:03:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2022-04-08 10:03:42,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:42,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,374 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,374 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:42,375 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 10:03:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-08 10:03:42,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:42,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:42,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 72 states. [2022-04-08 10:03:42,375 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 72 states. [2022-04-08 10:03:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:42,376 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 10:03:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-08 10:03:42,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:42,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:42,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:42,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:03:42,377 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-08 10:03:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:42,377 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:03:42,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:42,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:03:42,708 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:03:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:03:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:42,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:42,709 INFO L499 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:42,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:42,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-08 10:03:42,916 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1412389110, now seen corresponding path program 105 times [2022-04-08 10:03:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:42,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409577349] [2022-04-08 10:03:42,919 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:42,919 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1412389110, now seen corresponding path program 106 times [2022-04-08 10:03:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:42,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533628152] [2022-04-08 10:03:42,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:43,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:43,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {29190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {29169#true} is VALID [2022-04-08 10:03:43,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 10:03:43,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-08 10:03:43,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:43,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {29190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {29169#true} is VALID [2022-04-08 10:03:43,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 10:03:43,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-08 10:03:43,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {29169#true} call #t~ret9 := main(); {29169#true} is VALID [2022-04-08 10:03:43,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {29169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29174#(= main_~y~0 0)} is VALID [2022-04-08 10:03:43,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {29174#(= 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; {29175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:43,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {29175#(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; {29176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:43,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {29176#(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; {29177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:43,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {29177#(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; {29178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:43,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {29178#(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; {29179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:43,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {29179#(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; {29180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:43,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {29180#(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; {29181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:43,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {29181#(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; {29182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:43,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {29182#(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; {29183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:43,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {29183#(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; {29184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:43,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {29184#(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; {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {29186#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:43,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {29186#(and (<= main_~z~0 11) (<= 11 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; {29187#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:43,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {29187#(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; {29188#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:43,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {29188#(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; {29189#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:43,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {29189#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {29170#false} is VALID [2022-04-08 10:03:43,172 INFO L272 TraceCheckUtils]: 23: Hoare triple {29170#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29170#false} is VALID [2022-04-08 10:03:43,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-08 10:03:43,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-08 10:03:43,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-08 10:03:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533628152] [2022-04-08 10:03:43,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533628152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979366559] [2022-04-08 10:03:43,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:43,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:43,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:43,173 INFO L229 MonitoredProcess]: Starting monitored process 67 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:03:43,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-08 10:03:43,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:43,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:43,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:43,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:43,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-08 10:03:43,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#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); {29169#true} is VALID [2022-04-08 10:03:43,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 10:03:43,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-08 10:03:43,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {29169#true} call #t~ret9 := main(); {29169#true} is VALID [2022-04-08 10:03:43,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {29169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29174#(= main_~y~0 0)} is VALID [2022-04-08 10:03:43,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {29174#(= 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; {29175#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:43,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {29175#(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; {29176#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:43,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {29176#(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; {29177#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:43,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {29177#(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; {29178#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:43,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {29178#(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; {29179#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:43,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {29179#(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; {29180#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:43,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {29180#(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; {29181#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:43,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {29181#(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; {29182#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:43,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {29182#(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; {29183#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:43,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {29183#(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; {29184#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:43,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {29184#(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; {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:43,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {29185#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {29186#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:43,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {29186#(and (<= main_~z~0 11) (<= 11 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; {29187#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:43,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {29187#(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; {29188#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:43,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {29188#(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; {29257#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:43,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {29257#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {29170#false} is VALID [2022-04-08 10:03:43,514 INFO L272 TraceCheckUtils]: 23: Hoare triple {29170#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29170#false} is VALID [2022-04-08 10:03:43,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-08 10:03:43,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-08 10:03:43,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-08 10:03:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:43,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:43,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2022-04-08 10:03:43,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {29170#false} assume 0 == ~cond; {29170#false} is VALID [2022-04-08 10:03:43,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {29170#false} ~cond := #in~cond; {29170#false} is VALID [2022-04-08 10:03:43,998 INFO L272 TraceCheckUtils]: 23: Hoare triple {29170#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29170#false} is VALID [2022-04-08 10:03:43,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {29285#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29170#false} is VALID [2022-04-08 10:03:43,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {29289#(< 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; {29285#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:44,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {29293#(< 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; {29289#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:44,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {29297#(< 0 (mod (+ main_~z~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; {29293#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:44,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {29301#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {29297#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:44,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {29301#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {29301#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:44,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {29308#(< 0 (mod (+ main_~y~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; {29301#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:44,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {29312#(< 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; {29308#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:44,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {29316#(< 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; {29312#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:44,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {29320#(< 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; {29316#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:44,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {29324#(< 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; {29320#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:44,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {29328#(< 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; {29324#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:44,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {29332#(< 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; {29328#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:44,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {29336#(< 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; {29332#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:44,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {29340#(< 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; {29336#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:44,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {29344#(< 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; {29340#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:44,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {29348#(< 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; {29344#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:44,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {29169#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29348#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:44,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {29169#true} call #t~ret9 := main(); {29169#true} is VALID [2022-04-08 10:03:44,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29169#true} {29169#true} #50#return; {29169#true} is VALID [2022-04-08 10:03:44,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {29169#true} assume true; {29169#true} is VALID [2022-04-08 10:03:44,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {29169#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); {29169#true} is VALID [2022-04-08 10:03:44,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2022-04-08 10:03:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:44,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979366559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:44,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:44,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:03:44,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409577349] [2022-04-08 10:03:44,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409577349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:44,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:44,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417279497] [2022-04-08 10:03:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:44,011 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:44,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:44,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:44,030 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:03:44,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:44,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:44,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:44,030 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:45,779 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-08 10:03:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:03:45,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:45,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-08 10:03:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-08 10:03:45,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 67 transitions. [2022-04-08 10:03:45,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:45,815 INFO L225 Difference]: With dead ends: 82 [2022-04-08 10:03:45,815 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 10:03:45,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=653, Invalid=2653, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:03:45,815 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:45,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 109 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 10:03:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 43. [2022-04-08 10:03:46,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:46,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:46,030 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:46,030 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:46,031 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-08 10:03:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-08 10:03:46,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:46,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:46,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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:03:46,032 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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:03:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:46,032 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-08 10:03:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-08 10:03:46,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:46,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:46,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:46,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:03:46,033 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-08 10:03:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:46,034 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:03:46,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:46,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:03:46,371 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:03:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:03:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:46,371 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:46,371 INFO L499 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:46,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:46,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-08 10:03:46,587 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:46,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:46,587 INFO L85 PathProgramCache]: Analyzing trace with hash 473763159, now seen corresponding path program 107 times [2022-04-08 10:03:46,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:46,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970086380] [2022-04-08 10:03:46,589 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:46,589 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:46,589 INFO L85 PathProgramCache]: Analyzing trace with hash 473763159, now seen corresponding path program 108 times [2022-04-08 10:03:46,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:46,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158826070] [2022-04-08 10:03:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:46,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:46,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:46,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {29838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {29817#true} is VALID [2022-04-08 10:03:46,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-08 10:03:46,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-08 10:03:46,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {29817#true} call ULTIMATE.init(); {29838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:46,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {29838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {29817#true} is VALID [2022-04-08 10:03:46,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-08 10:03:46,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-08 10:03:46,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {29817#true} call #t~ret9 := main(); {29817#true} is VALID [2022-04-08 10:03:46,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {29817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29822#(= main_~y~0 0)} is VALID [2022-04-08 10:03:46,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {29822#(= 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; {29823#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:46,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {29823#(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; {29824#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:46,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {29824#(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; {29825#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:46,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {29825#(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; {29826#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:46,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {29826#(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; {29827#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:46,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {29827#(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; {29828#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:46,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {29828#(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; {29829#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:46,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {29829#(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; {29830#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:46,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {29830#(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; {29831#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:46,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {29831#(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; {29832#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:46,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {29832#(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; {29833#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:46,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {29833#(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; {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:46,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:46,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {29835#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:46,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {29835#(and (<= main_~z~0 12) (<= 12 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; {29836#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:46,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {29836#(and (<= main_~z~0 11) (<= 11 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; {29837#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:46,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {29837#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {29818#false} is VALID [2022-04-08 10:03:46,845 INFO L272 TraceCheckUtils]: 23: Hoare triple {29818#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29818#false} is VALID [2022-04-08 10:03:46,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {29818#false} ~cond := #in~cond; {29818#false} is VALID [2022-04-08 10:03:46,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {29818#false} assume 0 == ~cond; {29818#false} is VALID [2022-04-08 10:03:46,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {29818#false} assume !false; {29818#false} is VALID [2022-04-08 10:03:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158826070] [2022-04-08 10:03:46,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158826070] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628366619] [2022-04-08 10:03:46,845 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:46,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:46,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:46,847 INFO L229 MonitoredProcess]: Starting monitored process 68 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:03:46,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-08 10:03:46,987 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:03:46,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:46,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:46,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:47,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {29817#true} call ULTIMATE.init(); {29817#true} is VALID [2022-04-08 10:03:47,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {29817#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); {29817#true} is VALID [2022-04-08 10:03:47,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-08 10:03:47,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-08 10:03:47,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {29817#true} call #t~ret9 := main(); {29817#true} is VALID [2022-04-08 10:03:47,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {29817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29822#(= main_~y~0 0)} is VALID [2022-04-08 10:03:47,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {29822#(= 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; {29823#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:47,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {29823#(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; {29824#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:47,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {29824#(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; {29825#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:47,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {29825#(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; {29826#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:47,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {29826#(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; {29827#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:47,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {29827#(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; {29828#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:47,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {29828#(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; {29829#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:47,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {29829#(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; {29830#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:47,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {29830#(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; {29831#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:47,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {29831#(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; {29832#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:47,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {29832#(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; {29833#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:47,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {29833#(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; {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:47,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:47,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {29834#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {29835#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:47,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {29835#(and (<= main_~z~0 12) (<= 12 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; {29836#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:47,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {29836#(and (<= main_~z~0 11) (<= 11 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; {29905#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:47,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {29905#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {29818#false} is VALID [2022-04-08 10:03:47,269 INFO L272 TraceCheckUtils]: 23: Hoare triple {29818#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29818#false} is VALID [2022-04-08 10:03:47,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {29818#false} ~cond := #in~cond; {29818#false} is VALID [2022-04-08 10:03:47,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {29818#false} assume 0 == ~cond; {29818#false} is VALID [2022-04-08 10:03:47,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {29818#false} assume !false; {29818#false} is VALID [2022-04-08 10:03:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:47,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:47,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {29818#false} assume !false; {29818#false} is VALID [2022-04-08 10:03:47,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {29818#false} assume 0 == ~cond; {29818#false} is VALID [2022-04-08 10:03:47,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {29818#false} ~cond := #in~cond; {29818#false} is VALID [2022-04-08 10:03:47,626 INFO L272 TraceCheckUtils]: 23: Hoare triple {29818#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29818#false} is VALID [2022-04-08 10:03:47,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {29933#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29818#false} is VALID [2022-04-08 10:03:47,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {29937#(< 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; {29933#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:47,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {29941#(< 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; {29937#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:47,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {29945#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {29941#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:47,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {29945#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {29945#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:47,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {29952#(< 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; {29945#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:47,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {29956#(< 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; {29952#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:47,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {29960#(< 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; {29956#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:47,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {29964#(< 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; {29960#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:47,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {29968#(< 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; {29964#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:47,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {29972#(< 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; {29968#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:47,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {29976#(< 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; {29972#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:47,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {29980#(< 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; {29976#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:47,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {29984#(< 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; {29980#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:47,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {29988#(< 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; {29984#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:47,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {29992#(< 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; {29988#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:47,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {29996#(< 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; {29992#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:47,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {29817#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29996#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:47,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {29817#true} call #t~ret9 := main(); {29817#true} is VALID [2022-04-08 10:03:47,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29817#true} {29817#true} #50#return; {29817#true} is VALID [2022-04-08 10:03:47,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {29817#true} assume true; {29817#true} is VALID [2022-04-08 10:03:47,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {29817#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); {29817#true} is VALID [2022-04-08 10:03:47,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {29817#true} call ULTIMATE.init(); {29817#true} is VALID [2022-04-08 10:03:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:47,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628366619] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:47,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:47,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:03:47,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:47,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970086380] [2022-04-08 10:03:47,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970086380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:47,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:47,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225540438] [2022-04-08 10:03:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:47,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:47,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:47,646 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:03:47,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:47,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:47,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:47,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:47,647 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:49,349 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-04-08 10:03:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:03:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-08 10:03:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2022-04-08 10:03:49,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 69 transitions. [2022-04-08 10:03:49,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:49,385 INFO L225 Difference]: With dead ends: 86 [2022-04-08 10:03:49,385 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 10:03:49,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:03:49,386 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:49,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 104 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 10:03:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 43. [2022-04-08 10:03:49,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:49,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:49,583 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:49,583 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:49,584 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-08 10:03:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-08 10:03:49,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:49,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:49,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 81 states. [2022-04-08 10:03:49,584 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 81 states. [2022-04-08 10:03:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:49,585 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-08 10:03:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2022-04-08 10:03:49,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:49,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:49,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:49,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:03:49,586 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-08 10:03:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:49,586 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:03:49,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:49,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:03:49,936 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:03:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:03:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:49,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:49,937 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:49,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:50,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-08 10:03:50,140 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -110704426, now seen corresponding path program 109 times [2022-04-08 10:03:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:50,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908542719] [2022-04-08 10:03:50,143 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:50,143 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -110704426, now seen corresponding path program 110 times [2022-04-08 10:03:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:50,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959011918] [2022-04-08 10:03:50,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:50,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {30496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {30475#true} is VALID [2022-04-08 10:03:50,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-08 10:03:50,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-08 10:03:50,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {30475#true} call ULTIMATE.init(); {30496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:50,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {30496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {30475#true} is VALID [2022-04-08 10:03:50,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-08 10:03:50,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-08 10:03:50,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {30475#true} call #t~ret9 := main(); {30475#true} is VALID [2022-04-08 10:03:50,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {30475#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30480#(= main_~y~0 0)} is VALID [2022-04-08 10:03:50,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {30480#(= 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; {30481#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:50,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {30481#(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; {30482#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:50,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {30482#(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; {30483#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:50,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {30483#(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; {30484#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:50,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {30484#(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; {30485#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:50,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {30485#(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; {30486#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:50,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {30486#(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; {30487#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:50,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {30487#(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; {30488#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:50,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {30488#(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; {30489#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:50,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {30489#(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; {30490#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:50,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {30490#(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; {30491#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:50,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {30491#(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; {30492#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:50,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {30492#(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; {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:50,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:50,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {30494#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:03:50,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {30494#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30495#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:50,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {30495#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30476#false} is VALID [2022-04-08 10:03:50,374 INFO L272 TraceCheckUtils]: 23: Hoare triple {30476#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30476#false} is VALID [2022-04-08 10:03:50,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {30476#false} ~cond := #in~cond; {30476#false} is VALID [2022-04-08 10:03:50,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {30476#false} assume 0 == ~cond; {30476#false} is VALID [2022-04-08 10:03:50,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {30476#false} assume !false; {30476#false} is VALID [2022-04-08 10:03:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:50,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:50,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959011918] [2022-04-08 10:03:50,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959011918] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:50,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121616935] [2022-04-08 10:03:50,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:50,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:50,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:50,376 INFO L229 MonitoredProcess]: Starting monitored process 69 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:03:50,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-08 10:03:50,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:50,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:50,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:50,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:50,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {30475#true} call ULTIMATE.init(); {30475#true} is VALID [2022-04-08 10:03:50,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {30475#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); {30475#true} is VALID [2022-04-08 10:03:50,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-08 10:03:50,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-08 10:03:50,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {30475#true} call #t~ret9 := main(); {30475#true} is VALID [2022-04-08 10:03:50,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {30475#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30480#(= main_~y~0 0)} is VALID [2022-04-08 10:03:50,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {30480#(= 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; {30481#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:50,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {30481#(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; {30482#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:50,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {30482#(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; {30483#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:50,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {30483#(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; {30484#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:50,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {30484#(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; {30485#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:50,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {30485#(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; {30486#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:50,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {30486#(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; {30487#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:50,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {30487#(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; {30488#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:50,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {30488#(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; {30489#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:50,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {30489#(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; {30490#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:50,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {30490#(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; {30491#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:50,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {30491#(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; {30492#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:50,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {30492#(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; {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:50,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:50,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {30493#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {30494#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:03:50,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {30494#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30563#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:03:50,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {30563#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30476#false} is VALID [2022-04-08 10:03:50,593 INFO L272 TraceCheckUtils]: 23: Hoare triple {30476#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30476#false} is VALID [2022-04-08 10:03:50,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {30476#false} ~cond := #in~cond; {30476#false} is VALID [2022-04-08 10:03:50,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {30476#false} assume 0 == ~cond; {30476#false} is VALID [2022-04-08 10:03:50,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {30476#false} assume !false; {30476#false} is VALID [2022-04-08 10:03:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:50,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:50,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {30476#false} assume !false; {30476#false} is VALID [2022-04-08 10:03:50,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {30476#false} assume 0 == ~cond; {30476#false} is VALID [2022-04-08 10:03:50,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {30476#false} ~cond := #in~cond; {30476#false} is VALID [2022-04-08 10:03:50,921 INFO L272 TraceCheckUtils]: 23: Hoare triple {30476#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30476#false} is VALID [2022-04-08 10:03:50,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {30591#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30476#false} is VALID [2022-04-08 10:03:50,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {30595#(< 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; {30591#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:50,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {30599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {30595#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:50,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {30599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:50,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {30606#(< 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; {30599#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:50,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {30610#(< 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; {30606#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:50,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {30614#(< 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; {30610#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:50,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {30618#(< 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; {30614#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:50,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {30622#(< 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; {30618#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:50,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {30626#(< 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; {30622#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:50,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {30630#(< 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; {30626#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:50,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {30634#(< 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; {30630#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:50,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {30638#(< 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; {30634#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:50,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {30642#(< 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; {30638#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:50,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {30646#(< 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; {30642#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:50,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {30650#(< 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; {30646#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:50,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {30654#(< 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; {30650#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:03:50,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {30475#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30654#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:03:50,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {30475#true} call #t~ret9 := main(); {30475#true} is VALID [2022-04-08 10:03:50,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30475#true} {30475#true} #50#return; {30475#true} is VALID [2022-04-08 10:03:50,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {30475#true} assume true; {30475#true} is VALID [2022-04-08 10:03:50,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {30475#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); {30475#true} is VALID [2022-04-08 10:03:50,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {30475#true} call ULTIMATE.init(); {30475#true} is VALID [2022-04-08 10:03:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:50,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121616935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:50,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:50,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:03:50,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:50,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908542719] [2022-04-08 10:03:50,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908542719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:50,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:50,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046511131] [2022-04-08 10:03:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:50,942 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:50,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:50,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:50,958 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:03:50,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:50,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:50,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:50,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:50,959 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:53,198 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-04-08 10:03:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:03:53,198 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2022-04-08 10:03:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2022-04-08 10:03:53,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 72 transitions. [2022-04-08 10:03:53,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:53,267 INFO L225 Difference]: With dead ends: 89 [2022-04-08 10:03:53,267 INFO L226 Difference]: Without dead ends: 84 [2022-04-08 10:03:53,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:03:53,267 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:53,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 114 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:03:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-08 10:03:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 43. [2022-04-08 10:03:53,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:53,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,547 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,547 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:53,548 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-04-08 10:03:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-04-08 10:03:53,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:53,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:53,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 84 states. [2022-04-08 10:03:53,548 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 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 84 states. [2022-04-08 10:03:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:53,549 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-04-08 10:03:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-04-08 10:03:53,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:53,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:53,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:53,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:03:53,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2022-04-08 10:03:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:53,550 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:03:53,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:53,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:03:53,922 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:03:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:03:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:53,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:53,922 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:53,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:54,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-08 10:03:54,135 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:54,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2087199095, now seen corresponding path program 27 times [2022-04-08 10:03:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:54,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658737991] [2022-04-08 10:03:54,138 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:54,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2087199095, now seen corresponding path program 28 times [2022-04-08 10:03:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:54,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002992640] [2022-04-08 10:03:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:54,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {31162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {31141#true} is VALID [2022-04-08 10:03:54,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-08 10:03:54,361 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-08 10:03:54,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {31141#true} call ULTIMATE.init(); {31162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:54,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {31162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {31141#true} is VALID [2022-04-08 10:03:54,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-08 10:03:54,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-08 10:03:54,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {31141#true} call #t~ret9 := main(); {31141#true} is VALID [2022-04-08 10:03:54,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {31141#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31146#(= main_~y~0 0)} is VALID [2022-04-08 10:03:54,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {31146#(= 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; {31147#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:54,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {31147#(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; {31148#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:54,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {31148#(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; {31149#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:54,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {31149#(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; {31150#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:54,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {31150#(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; {31151#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {31151#(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; {31152#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:54,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {31152#(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; {31153#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:54,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {31153#(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; {31154#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:54,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {31154#(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; {31155#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:54,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {31155#(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; {31156#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:54,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {31156#(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; {31157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:54,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {31157#(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; {31158#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:54,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {31158#(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; {31159#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:54,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {31159#(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; {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:03:54,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:03:54,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {31161#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:54,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {31161#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31142#false} is VALID [2022-04-08 10:03:54,371 INFO L272 TraceCheckUtils]: 23: Hoare triple {31142#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31142#false} is VALID [2022-04-08 10:03:54,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {31142#false} ~cond := #in~cond; {31142#false} is VALID [2022-04-08 10:03:54,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {31142#false} assume 0 == ~cond; {31142#false} is VALID [2022-04-08 10:03:54,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {31142#false} assume !false; {31142#false} is VALID [2022-04-08 10:03:54,371 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:03:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:54,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002992640] [2022-04-08 10:03:54,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002992640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:54,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373971968] [2022-04-08 10:03:54,372 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:54,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:54,372 INFO L229 MonitoredProcess]: Starting monitored process 70 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:03:54,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-08 10:03:54,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:54,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:54,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:54,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:54,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {31141#true} call ULTIMATE.init(); {31141#true} is VALID [2022-04-08 10:03:54,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {31141#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); {31141#true} is VALID [2022-04-08 10:03:54,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-08 10:03:54,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-08 10:03:54,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {31141#true} call #t~ret9 := main(); {31141#true} is VALID [2022-04-08 10:03:54,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {31141#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31146#(= main_~y~0 0)} is VALID [2022-04-08 10:03:54,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {31146#(= 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; {31147#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:54,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {31147#(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; {31148#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:54,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {31148#(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; {31149#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:54,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {31149#(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; {31150#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:54,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {31150#(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; {31151#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:54,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {31151#(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; {31152#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:54,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {31152#(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; {31153#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:54,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {31153#(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; {31154#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:54,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {31154#(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; {31155#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:54,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {31155#(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; {31156#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:54,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {31156#(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; {31157#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:54,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {31157#(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; {31158#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:03:54,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {31158#(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; {31159#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:03:54,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {31159#(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; {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:03:54,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:03:54,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {31160#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {31229#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:03:54,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {31229#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {31142#false} is VALID [2022-04-08 10:03:54,655 INFO L272 TraceCheckUtils]: 23: Hoare triple {31142#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31142#false} is VALID [2022-04-08 10:03:54,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {31142#false} ~cond := #in~cond; {31142#false} is VALID [2022-04-08 10:03:54,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {31142#false} assume 0 == ~cond; {31142#false} is VALID [2022-04-08 10:03:54,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {31142#false} assume !false; {31142#false} is VALID [2022-04-08 10:03:54,655 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:03:54,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:55,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {31142#false} assume !false; {31142#false} is VALID [2022-04-08 10:03:55,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {31142#false} assume 0 == ~cond; {31142#false} is VALID [2022-04-08 10:03:55,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {31142#false} ~cond := #in~cond; {31142#false} is VALID [2022-04-08 10:03:55,094 INFO L272 TraceCheckUtils]: 23: Hoare triple {31142#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31142#false} is VALID [2022-04-08 10:03:55,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {31257#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31142#false} is VALID [2022-04-08 10:03:55,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {31261#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {31257#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:55,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {31261#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {31261#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:55,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {31268#(< 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; {31261#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:55,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {31272#(< 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; {31268#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:55,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {31276#(< 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; {31272#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:55,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {31280#(< 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; {31276#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:55,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {31284#(< 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; {31280#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:55,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {31288#(< 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; {31284#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:55,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {31292#(< 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; {31288#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:55,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {31296#(< 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; {31292#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:55,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {31300#(< 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; {31296#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:55,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {31304#(< 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; {31300#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:55,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {31308#(< 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; {31304#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:55,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {31312#(< 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; {31308#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:03:55,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {31316#(< 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; {31312#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:03:55,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {31320#(< 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; {31316#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:03:55,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {31141#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31320#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:03:55,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {31141#true} call #t~ret9 := main(); {31141#true} is VALID [2022-04-08 10:03:55,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31141#true} {31141#true} #50#return; {31141#true} is VALID [2022-04-08 10:03:55,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {31141#true} assume true; {31141#true} is VALID [2022-04-08 10:03:55,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {31141#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); {31141#true} is VALID [2022-04-08 10:03:55,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {31141#true} call ULTIMATE.init(); {31141#true} is VALID [2022-04-08 10:03:55,104 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:03:55,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373971968] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:55,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:55,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:03:55,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:55,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658737991] [2022-04-08 10:03:55,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658737991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:55,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:55,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555353983] [2022-04-08 10:03:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:55,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:55,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:55,121 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:03:55,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:03:55,122 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:57,446 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2022-04-08 10:03:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:03:57,446 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 10:03:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 76 transitions. [2022-04-08 10:03:57,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 76 transitions. [2022-04-08 10:03:57,490 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:03:57,491 INFO L225 Difference]: With dead ends: 94 [2022-04-08 10:03:57,492 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 10:03:57,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 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:03:57,492 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 72 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:57,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 122 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:03:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 10:03:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 45. [2022-04-08 10:03:57,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:57,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 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:03:57,702 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 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:03:57,702 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 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:03:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:57,703 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-08 10:03:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-04-08 10:03:57,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:57,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:57,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 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 89 states. [2022-04-08 10:03:57,703 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 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 89 states. [2022-04-08 10:03:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:57,704 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-08 10:03:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2022-04-08 10:03:57,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:57,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:57,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:57,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.25) internal successors, (50), 40 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:03:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-04-08 10:03:57,705 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2022-04-08 10:03:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:57,705 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-04-08 10:03:57,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 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:03:57,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 54 transitions. [2022-04-08 10:03:58,056 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:03:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-08 10:03:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:03:58,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:58,057 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:58,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:58,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:58,266 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash -667770900, now seen corresponding path program 111 times [2022-04-08 10:03:58,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:58,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262364837] [2022-04-08 10:03:58,269 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:58,269 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash -667770900, now seen corresponding path program 112 times [2022-04-08 10:03:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:58,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012309349] [2022-04-08 10:03:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:58,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:58,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {31850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {31829#true} is VALID [2022-04-08 10:03:58,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-08 10:03:58,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-08 10:03:58,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {31829#true} call ULTIMATE.init(); {31850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:58,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {31850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {31829#true} is VALID [2022-04-08 10:03:58,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-08 10:03:58,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-08 10:03:58,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {31829#true} call #t~ret9 := main(); {31829#true} is VALID [2022-04-08 10:03:58,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {31829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31834#(= main_~y~0 0)} is VALID [2022-04-08 10:03:58,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {31834#(= 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; {31835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:58,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {31835#(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; {31836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:58,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {31836#(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; {31837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:58,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {31837#(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; {31838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:58,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {31838#(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; {31839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:58,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {31839#(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; {31840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:58,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {31840#(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; {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:58,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:58,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {31842#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:58,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {31842#(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; {31843#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:58,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {31843#(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; {31844#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:58,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {31844#(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; {31845#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:58,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {31845#(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; {31846#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:58,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {31846#(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; {31847#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:58,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {31847#(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; {31848#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:58,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {31848#(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; {31849#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:58,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {31849#(and (<= main_~z~0 0) (<= 0 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; {31830#false} is VALID [2022-04-08 10:03:58,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {31830#false} assume !(~z~0 % 4294967296 > 0); {31830#false} is VALID [2022-04-08 10:03:58,518 INFO L272 TraceCheckUtils]: 24: Hoare triple {31830#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31830#false} is VALID [2022-04-08 10:03:58,518 INFO L290 TraceCheckUtils]: 25: Hoare triple {31830#false} ~cond := #in~cond; {31830#false} is VALID [2022-04-08 10:03:58,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {31830#false} assume 0 == ~cond; {31830#false} is VALID [2022-04-08 10:03:58,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {31830#false} assume !false; {31830#false} is VALID [2022-04-08 10:03:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012309349] [2022-04-08 10:03:58,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012309349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571469680] [2022-04-08 10:03:58,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:58,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:58,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:58,520 INFO L229 MonitoredProcess]: Starting monitored process 71 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:03:58,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-08 10:03:58,568 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:58,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:58,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:03:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:58,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:58,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {31829#true} call ULTIMATE.init(); {31829#true} is VALID [2022-04-08 10:03:58,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {31829#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); {31829#true} is VALID [2022-04-08 10:03:58,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-08 10:03:58,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-08 10:03:58,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {31829#true} call #t~ret9 := main(); {31829#true} is VALID [2022-04-08 10:03:58,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {31829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31834#(= main_~y~0 0)} is VALID [2022-04-08 10:03:58,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {31834#(= 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; {31835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:58,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {31835#(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; {31836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:58,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {31836#(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; {31837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:58,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {31837#(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; {31838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:58,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {31838#(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; {31839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:58,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {31839#(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; {31840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:58,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {31840#(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; {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:58,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:58,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {31841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {31842#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:58,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {31842#(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; {31843#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:58,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {31843#(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; {31844#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:58,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {31844#(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; {31845#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:58,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {31845#(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; {31846#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:58,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {31846#(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; {31847#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:58,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {31847#(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; {31848#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:58,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {31848#(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; {31849#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:58,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {31849#(and (<= main_~z~0 0) (<= 0 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; {31830#false} is VALID [2022-04-08 10:03:58,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {31830#false} assume !(~z~0 % 4294967296 > 0); {31830#false} is VALID [2022-04-08 10:03:58,850 INFO L272 TraceCheckUtils]: 24: Hoare triple {31830#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31830#false} is VALID [2022-04-08 10:03:58,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {31830#false} ~cond := #in~cond; {31830#false} is VALID [2022-04-08 10:03:58,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {31830#false} assume 0 == ~cond; {31830#false} is VALID [2022-04-08 10:03:58,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {31830#false} assume !false; {31830#false} is VALID [2022-04-08 10:03:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:58,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:59,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {31830#false} assume !false; {31830#false} is VALID [2022-04-08 10:03:59,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {31830#false} assume 0 == ~cond; {31830#false} is VALID [2022-04-08 10:03:59,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {31830#false} ~cond := #in~cond; {31830#false} is VALID [2022-04-08 10:03:59,261 INFO L272 TraceCheckUtils]: 24: Hoare triple {31830#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31830#false} is VALID [2022-04-08 10:03:59,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {31830#false} assume !(~z~0 % 4294967296 > 0); {31830#false} is VALID [2022-04-08 10:03:59,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {31950#(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; {31830#false} is VALID [2022-04-08 10:03:59,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {31954#(not (< 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; {31950#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-08 10:03:59,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {31958#(not (< 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; {31954#(not (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:59,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {31962#(not (< 0 (mod (+ main_~z~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; {31958#(not (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:59,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {31966#(not (< 0 (mod (+ 4294967292 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; {31962#(not (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:59,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {31970#(not (< 0 (mod (+ 4294967291 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; {31966#(not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:03:59,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {31974#(not (< 0 (mod (+ 4294967290 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; {31970#(not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:03:59,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {31978#(not (< 0 (mod (+ main_~z~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; {31974#(not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-08 10:03:59,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {31982#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} ~z~0 := ~y~0; {31978#(not (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:03:59,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {31982#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {31982#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:03:59,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {31989#(not (< 0 (mod (+ 4294967290 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; {31982#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:03:59,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {31993#(not (< 0 (mod (+ 4294967291 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; {31989#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:59,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {31997#(not (< 0 (mod (+ 4294967292 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; {31993#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:59,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {32001#(not (< 0 (mod (+ main_~y~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; {31997#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:03:59,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {32005#(not (< 0 (mod (+ main_~y~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; {32001#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:59,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {32009#(not (< 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; {32005#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:59,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {32013#(not (< 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; {32009#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:59,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {31829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32013#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:59,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {31829#true} call #t~ret9 := main(); {31829#true} is VALID [2022-04-08 10:03:59,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31829#true} {31829#true} #50#return; {31829#true} is VALID [2022-04-08 10:03:59,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {31829#true} assume true; {31829#true} is VALID [2022-04-08 10:03:59,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {31829#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); {31829#true} is VALID [2022-04-08 10:03:59,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {31829#true} call ULTIMATE.init(); {31829#true} is VALID [2022-04-08 10:03:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:59,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571469680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:59,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:59,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 35 [2022-04-08 10:03:59,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:59,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262364837] [2022-04-08 10:03:59,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262364837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:59,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:59,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:03:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956783730] [2022-04-08 10:03:59,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:59,273 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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:03:59,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:59,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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:03:59,291 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:03:59,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:03:59,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:59,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:03:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1107, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:03:59,292 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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:04:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:00,631 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-08 10:04:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:04:00,631 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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:04:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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:04:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 39 transitions. [2022-04-08 10:04:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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:04:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 39 transitions. [2022-04-08 10:04:00,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 39 transitions. [2022-04-08 10:04:00,664 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:04:00,664 INFO L225 Difference]: With dead ends: 58 [2022-04-08 10:04:00,664 INFO L226 Difference]: Without dead ends: 43 [2022-04-08 10:04:00,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=2363, Unknown=0, NotChecked=0, Total=2550 [2022-04-08 10:04:00,665 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:00,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-08 10:04:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-08 10:04:00,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:00,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,958 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,958 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:00,959 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-08 10:04:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:04:00,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:00,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:00,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 10:04:00,959 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-08 10:04:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:00,960 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-08 10:04:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:04:00,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:00,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:00,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:00,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-04-08 10:04:00,960 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 28 [2022-04-08 10:04:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:00,960 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-04-08 10:04:00,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 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:04:00,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 51 transitions. [2022-04-08 10:04:01,355 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:04:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-08 10:04:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:01,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:01,356 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:01,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:01,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:01,571 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:01,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -568623061, now seen corresponding path program 113 times [2022-04-08 10:04:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:01,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [103810230] [2022-04-08 10:04:01,573 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:01,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash -568623061, now seen corresponding path program 114 times [2022-04-08 10:04:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:01,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536968841] [2022-04-08 10:04:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:01,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:01,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {32376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {32354#true} is VALID [2022-04-08 10:04:01,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-08 10:04:01,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-08 10:04:01,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {32354#true} call ULTIMATE.init(); {32376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:01,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {32376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {32354#true} is VALID [2022-04-08 10:04:01,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-08 10:04:01,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-08 10:04:01,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {32354#true} call #t~ret9 := main(); {32354#true} is VALID [2022-04-08 10:04:01,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {32354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32359#(= main_~y~0 0)} is VALID [2022-04-08 10:04:01,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {32359#(= 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; {32360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:01,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {32360#(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; {32361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:01,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {32361#(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; {32362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:01,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {32362#(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; {32363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:01,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {32363#(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; {32364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:01,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {32364#(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; {32365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:01,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {32365#(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; {32366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:01,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {32366#(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; {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:01,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:01,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {32368#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:01,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {32368#(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; {32369#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:01,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {32369#(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; {32370#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:01,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {32370#(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; {32371#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:01,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {32371#(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; {32372#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:01,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {32372#(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; {32373#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:01,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {32373#(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; {32374#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:01,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {32374#(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; {32375#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:04:01,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {32375#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32355#false} is VALID [2022-04-08 10:04:01,846 INFO L272 TraceCheckUtils]: 24: Hoare triple {32355#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32355#false} is VALID [2022-04-08 10:04:01,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {32355#false} ~cond := #in~cond; {32355#false} is VALID [2022-04-08 10:04:01,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {32355#false} assume 0 == ~cond; {32355#false} is VALID [2022-04-08 10:04:01,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {32355#false} assume !false; {32355#false} is VALID [2022-04-08 10:04:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:01,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536968841] [2022-04-08 10:04:01,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536968841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:01,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732974925] [2022-04-08 10:04:01,847 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:01,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:01,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:01,848 INFO L229 MonitoredProcess]: Starting monitored process 72 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:04:01,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-08 10:04:01,898 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:04:01,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:01,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:01,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:02,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {32354#true} call ULTIMATE.init(); {32354#true} is VALID [2022-04-08 10:04:02,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {32354#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); {32354#true} is VALID [2022-04-08 10:04:02,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-08 10:04:02,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-08 10:04:02,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {32354#true} call #t~ret9 := main(); {32354#true} is VALID [2022-04-08 10:04:02,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {32354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32359#(= main_~y~0 0)} is VALID [2022-04-08 10:04:02,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {32359#(= 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; {32360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:02,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {32360#(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; {32361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:02,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {32361#(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; {32362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:02,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {32362#(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; {32363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:02,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {32363#(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; {32364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:02,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {32364#(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; {32365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:02,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {32365#(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; {32366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:02,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {32366#(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; {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:02,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:02,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {32367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {32368#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:02,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {32368#(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; {32369#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:02,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {32369#(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; {32370#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:02,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {32370#(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; {32371#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:02,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {32371#(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; {32372#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:02,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {32372#(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; {32373#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:02,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {32373#(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; {32374#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:02,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {32374#(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; {32446#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:04:02,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {32446#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32355#false} is VALID [2022-04-08 10:04:02,139 INFO L272 TraceCheckUtils]: 24: Hoare triple {32355#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32355#false} is VALID [2022-04-08 10:04:02,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {32355#false} ~cond := #in~cond; {32355#false} is VALID [2022-04-08 10:04:02,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {32355#false} assume 0 == ~cond; {32355#false} is VALID [2022-04-08 10:04:02,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {32355#false} assume !false; {32355#false} is VALID [2022-04-08 10:04:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:02,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:02,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {32355#false} assume !false; {32355#false} is VALID [2022-04-08 10:04:02,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {32355#false} assume 0 == ~cond; {32355#false} is VALID [2022-04-08 10:04:02,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {32355#false} ~cond := #in~cond; {32355#false} is VALID [2022-04-08 10:04:02,527 INFO L272 TraceCheckUtils]: 24: Hoare triple {32355#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32355#false} is VALID [2022-04-08 10:04:02,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {32474#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32355#false} is VALID [2022-04-08 10:04:02,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {32478#(< 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; {32474#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:02,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {32482#(< 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; {32478#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:02,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {32486#(< 0 (mod (+ main_~z~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; {32482#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:02,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {32490#(< 0 (mod (+ 4294967292 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; {32486#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:02,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {32494#(< 0 (mod (+ 4294967291 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; {32490#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:02,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {32498#(< 0 (mod (+ 4294967290 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; {32494#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:02,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {32502#(< 0 (mod (+ main_~z~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; {32498#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:02,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {32506#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {32502#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:04:02,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {32506#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32506#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:04:02,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {32513#(< 0 (mod (+ 4294967290 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; {32506#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:04:02,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {32517#(< 0 (mod (+ 4294967291 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; {32513#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:02,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {32521#(< 0 (mod (+ 4294967292 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; {32517#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:02,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {32525#(< 0 (mod (+ main_~y~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; {32521#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:02,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {32529#(< 0 (mod (+ main_~y~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; {32525#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:02,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {32533#(< 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; {32529#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:02,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {32537#(< 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; {32533#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:02,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {32541#(< 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; {32537#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:02,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {32354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32541#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:02,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {32354#true} call #t~ret9 := main(); {32354#true} is VALID [2022-04-08 10:04:02,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32354#true} {32354#true} #50#return; {32354#true} is VALID [2022-04-08 10:04:02,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {32354#true} assume true; {32354#true} is VALID [2022-04-08 10:04:02,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {32354#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); {32354#true} is VALID [2022-04-08 10:04:02,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {32354#true} call ULTIMATE.init(); {32354#true} is VALID [2022-04-08 10:04:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:02,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732974925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:02,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:02,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:02,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:02,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [103810230] [2022-04-08 10:04:02,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [103810230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:02,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:02,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:02,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505261210] [2022-04-08 10:04:02,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:02,540 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:02,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:02,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:02,555 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:04:02,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:02,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1194, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:02,555 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:03,768 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 10:04:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:04:03,768 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-08 10:04:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-08 10:04:03,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 42 transitions. [2022-04-08 10:04:03,795 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:04:03,795 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:04:03,795 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 10:04:03,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=506, Invalid=2464, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:04:03,796 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:03,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 91 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 10:04:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2022-04-08 10:04:04,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:04,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:04,068 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:04,068 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:04,068 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 10:04:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 10:04:04,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:04,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:04,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 52 states. [2022-04-08 10:04:04,091 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 52 states. [2022-04-08 10:04:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:04,092 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-04-08 10:04:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-04-08 10:04:04,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:04,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:04,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:04,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 10:04:04,093 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-08 10:04:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:04,093 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 10:04:04,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:04,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 10:04:04,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 10:04:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:04,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:04,483 INFO L499 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:04,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:04,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:04,684 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -981066740, now seen corresponding path program 115 times [2022-04-08 10:04:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:04,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187308393] [2022-04-08 10:04:04,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:04,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash -981066740, now seen corresponding path program 116 times [2022-04-08 10:04:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:04,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592989781] [2022-04-08 10:04:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:04,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {32924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {32902#true} is VALID [2022-04-08 10:04:04,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-08 10:04:04,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-08 10:04:04,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:04,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {32924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {32902#true} is VALID [2022-04-08 10:04:04,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-08 10:04:04,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-08 10:04:04,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret9 := main(); {32902#true} is VALID [2022-04-08 10:04:04,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {32902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32907#(= main_~y~0 0)} is VALID [2022-04-08 10:04:04,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {32907#(= 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; {32908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:04,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {32908#(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; {32909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:04,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {32909#(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; {32910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:04,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {32910#(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; {32911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:04,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {32911#(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; {32912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:04,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {32912#(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; {32913#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:04,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {32913#(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; {32914#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:04,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {32914#(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; {32915#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:04,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {32915#(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; {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:04,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:04,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {32917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:04,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {32917#(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; {32918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:04,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {32918#(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; {32919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:04,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {32919#(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; {32920#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:04,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {32920#(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; {32921#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:04,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {32921#(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; {32922#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:04,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {32922#(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; {32923#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:04,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {32923#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-08 10:04:04,948 INFO L272 TraceCheckUtils]: 24: Hoare triple {32903#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32903#false} is VALID [2022-04-08 10:04:04,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-08 10:04:04,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-08 10:04:04,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-08 10:04:04,948 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:04:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592989781] [2022-04-08 10:04:04,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592989781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653302249] [2022-04-08 10:04:04,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:04,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:04,949 INFO L229 MonitoredProcess]: Starting monitored process 73 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:04:04,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-08 10:04:05,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:05,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:05,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:05,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:05,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32902#true} is VALID [2022-04-08 10:04:05,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {32902#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); {32902#true} is VALID [2022-04-08 10:04:05,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-08 10:04:05,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-08 10:04:05,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret9 := main(); {32902#true} is VALID [2022-04-08 10:04:05,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {32902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32907#(= main_~y~0 0)} is VALID [2022-04-08 10:04:05,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {32907#(= 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; {32908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:05,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {32908#(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; {32909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:05,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {32909#(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; {32910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:05,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {32910#(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; {32911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:05,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {32911#(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; {32912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:05,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {32912#(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; {32913#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:05,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {32913#(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; {32914#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:05,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {32914#(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; {32915#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:05,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {32915#(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; {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:05,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:05,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {32916#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {32917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:05,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {32917#(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; {32918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:05,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {32918#(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; {32919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:05,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {32919#(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; {32920#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:05,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {32920#(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; {32921#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:05,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {32921#(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; {32922#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:05,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {32922#(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; {32994#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:05,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {32994#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-08 10:04:05,395 INFO L272 TraceCheckUtils]: 24: Hoare triple {32903#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32903#false} is VALID [2022-04-08 10:04:05,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-08 10:04:05,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-08 10:04:05,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-08 10:04:05,396 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:04:05,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:05,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {32903#false} assume !false; {32903#false} is VALID [2022-04-08 10:04:05,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {32903#false} assume 0 == ~cond; {32903#false} is VALID [2022-04-08 10:04:05,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {32903#false} ~cond := #in~cond; {32903#false} is VALID [2022-04-08 10:04:05,834 INFO L272 TraceCheckUtils]: 24: Hoare triple {32903#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32903#false} is VALID [2022-04-08 10:04:05,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {33022#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32903#false} is VALID [2022-04-08 10:04:05,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {33026#(< 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; {33022#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:05,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {33030#(< 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; {33026#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:05,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {33034#(< 0 (mod (+ main_~z~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; {33030#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:05,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {33038#(< 0 (mod (+ 4294967292 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; {33034#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:05,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {33042#(< 0 (mod (+ 4294967291 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; {33038#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:05,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {33046#(< 0 (mod (+ 4294967290 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; {33042#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:05,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {33050#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {33046#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:05,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {33050#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {33050#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:05,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {33057#(< 0 (mod (+ 4294967291 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; {33050#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:05,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {33061#(< 0 (mod (+ 4294967292 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; {33057#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:05,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {33065#(< 0 (mod (+ main_~y~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; {33061#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:05,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {33069#(< 0 (mod (+ main_~y~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; {33065#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:05,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {33073#(< 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; {33069#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:05,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {33077#(< 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; {33073#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:05,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {33081#(< 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; {33077#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:05,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {33085#(< 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; {33081#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:05,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {33089#(< 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; {33085#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:05,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {32902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33089#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:05,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {32902#true} call #t~ret9 := main(); {32902#true} is VALID [2022-04-08 10:04:05,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32902#true} {32902#true} #50#return; {32902#true} is VALID [2022-04-08 10:04:05,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {32902#true} assume true; {32902#true} is VALID [2022-04-08 10:04:05,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {32902#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); {32902#true} is VALID [2022-04-08 10:04:05,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {32902#true} call ULTIMATE.init(); {32902#true} is VALID [2022-04-08 10:04:05,845 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:04:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653302249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:05,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:05,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:05,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187308393] [2022-04-08 10:04:05,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187308393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:05,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:05,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633894470] [2022-04-08 10:04:05,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:05,846 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:05,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:05,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:05,858 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:04:05,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:05,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:05,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:05,858 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:07,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:07,169 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-08 10:04:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:04:07,169 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:07,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-04-08 10:04:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2022-04-08 10:04:07,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 53 transitions. [2022-04-08 10:04:07,197 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:04:07,198 INFO L225 Difference]: With dead ends: 65 [2022-04-08 10:04:07,198 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 10:04:07,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=661, Invalid=2999, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:04:07,198 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:07,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 74 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 10:04:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2022-04-08 10:04:07,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:07,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:07,426 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:07,426 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:07,426 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 10:04:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-08 10:04:07,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:07,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:07,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 60 states. [2022-04-08 10:04:07,427 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 60 states. [2022-04-08 10:04:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:07,427 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-08 10:04:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-04-08 10:04:07,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:07,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:07,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:07,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 10:04:07,428 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-08 10:04:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:07,428 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 10:04:07,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:07,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 10:04:07,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 10:04:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:07,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:07,834 INFO L499 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:07,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:08,048 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-04-08 10:04:08,048 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash 945291275, now seen corresponding path program 117 times [2022-04-08 10:04:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1739969754] [2022-04-08 10:04:08,051 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:08,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 945291275, now seen corresponding path program 118 times [2022-04-08 10:04:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:08,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614855427] [2022-04-08 10:04:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:08,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {33516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {33494#true} is VALID [2022-04-08 10:04:08,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-08 10:04:08,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-08 10:04:08,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {33494#true} call ULTIMATE.init(); {33516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:08,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {33516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {33494#true} is VALID [2022-04-08 10:04:08,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-08 10:04:08,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-08 10:04:08,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {33494#true} call #t~ret9 := main(); {33494#true} is VALID [2022-04-08 10:04:08,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {33494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33499#(= main_~y~0 0)} is VALID [2022-04-08 10:04:08,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {33499#(= 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; {33500#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:08,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {33500#(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; {33501#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:08,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {33501#(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; {33502#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:08,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {33502#(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; {33503#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:08,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {33503#(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; {33504#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:08,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {33504#(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; {33505#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:08,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {33505#(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; {33506#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:08,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {33506#(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; {33507#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:08,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {33507#(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; {33508#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:08,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {33508#(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; {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:08,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:08,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {33510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:08,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {33510#(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; {33511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:08,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {33511#(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; {33512#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:08,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {33512#(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; {33513#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:08,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {33513#(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; {33514#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:08,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {33514#(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; {33515#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:08,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {33515#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {33495#false} is VALID [2022-04-08 10:04:08,349 INFO L272 TraceCheckUtils]: 24: Hoare triple {33495#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33495#false} is VALID [2022-04-08 10:04:08,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {33495#false} ~cond := #in~cond; {33495#false} is VALID [2022-04-08 10:04:08,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {33495#false} assume 0 == ~cond; {33495#false} is VALID [2022-04-08 10:04:08,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {33495#false} assume !false; {33495#false} is VALID [2022-04-08 10:04:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:08,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614855427] [2022-04-08 10:04:08,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614855427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:08,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402807535] [2022-04-08 10:04:08,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:08,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:08,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:08,351 INFO L229 MonitoredProcess]: Starting monitored process 74 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:04:08,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-08 10:04:08,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:08,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:08,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:08,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:08,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {33494#true} call ULTIMATE.init(); {33494#true} is VALID [2022-04-08 10:04:08,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {33494#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); {33494#true} is VALID [2022-04-08 10:04:08,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-08 10:04:08,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-08 10:04:08,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {33494#true} call #t~ret9 := main(); {33494#true} is VALID [2022-04-08 10:04:08,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {33494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33499#(= main_~y~0 0)} is VALID [2022-04-08 10:04:08,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {33499#(= 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; {33500#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:08,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {33500#(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; {33501#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:08,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {33501#(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; {33502#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:08,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {33502#(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; {33503#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:08,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {33503#(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; {33504#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:08,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {33504#(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; {33505#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:08,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {33505#(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; {33506#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:08,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {33506#(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; {33507#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:08,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {33507#(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; {33508#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:08,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {33508#(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; {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:08,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:08,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {33509#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {33510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:08,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {33510#(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; {33511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:08,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {33511#(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; {33512#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:08,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {33512#(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; {33513#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:08,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {33513#(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; {33514#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:08,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {33514#(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; {33586#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:08,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {33586#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {33495#false} is VALID [2022-04-08 10:04:08,603 INFO L272 TraceCheckUtils]: 24: Hoare triple {33495#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33495#false} is VALID [2022-04-08 10:04:08,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {33495#false} ~cond := #in~cond; {33495#false} is VALID [2022-04-08 10:04:08,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {33495#false} assume 0 == ~cond; {33495#false} is VALID [2022-04-08 10:04:08,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {33495#false} assume !false; {33495#false} is VALID [2022-04-08 10:04:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:08,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:09,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {33495#false} assume !false; {33495#false} is VALID [2022-04-08 10:04:09,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {33495#false} assume 0 == ~cond; {33495#false} is VALID [2022-04-08 10:04:09,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {33495#false} ~cond := #in~cond; {33495#false} is VALID [2022-04-08 10:04:09,127 INFO L272 TraceCheckUtils]: 24: Hoare triple {33495#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33495#false} is VALID [2022-04-08 10:04:09,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {33614#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33495#false} is VALID [2022-04-08 10:04:09,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {33618#(< 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; {33614#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:09,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {33622#(< 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; {33618#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:09,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {33626#(< 0 (mod (+ main_~z~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; {33622#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:09,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {33630#(< 0 (mod (+ 4294967292 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; {33626#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:09,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {33634#(< 0 (mod (+ 4294967291 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; {33630#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:09,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {33638#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {33634#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:09,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {33638#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {33638#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:09,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {33645#(< 0 (mod (+ 4294967292 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; {33638#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:09,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {33649#(< 0 (mod (+ main_~y~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; {33645#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:09,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {33653#(< 0 (mod (+ main_~y~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; {33649#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:09,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {33657#(< 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; {33653#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:09,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {33661#(< 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; {33657#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:09,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {33665#(< 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; {33661#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:09,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {33669#(< 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; {33665#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:09,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {33673#(< 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; {33669#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:09,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {33677#(< 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; {33673#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:09,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {33681#(< 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; {33677#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:09,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {33494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33681#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:09,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {33494#true} call #t~ret9 := main(); {33494#true} is VALID [2022-04-08 10:04:09,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33494#true} {33494#true} #50#return; {33494#true} is VALID [2022-04-08 10:04:09,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {33494#true} assume true; {33494#true} is VALID [2022-04-08 10:04:09,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {33494#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); {33494#true} is VALID [2022-04-08 10:04:09,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {33494#true} call ULTIMATE.init(); {33494#true} is VALID [2022-04-08 10:04:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:09,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402807535] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:09,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:09,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:09,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:09,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1739969754] [2022-04-08 10:04:09,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1739969754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:09,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:09,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720413333] [2022-04-08 10:04:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:09,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:09,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:09,163 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:04:09,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:09,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:09,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:09,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:09,163 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:11,307 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-08 10:04:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:04:11,307 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 61 transitions. [2022-04-08 10:04:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 61 transitions. [2022-04-08 10:04:11,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 61 transitions. [2022-04-08 10:04:11,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:11,339 INFO L225 Difference]: With dead ends: 72 [2022-04-08 10:04:11,339 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 10:04:11,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=759, Invalid=3273, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:04:11,340 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:11,340 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 97 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:04:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 10:04:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2022-04-08 10:04:11,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:11,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:11,564 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:11,564 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:11,564 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-08 10:04:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-08 10:04:11,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:11,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:11,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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:04:11,565 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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:04:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:11,565 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-08 10:04:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-08 10:04:11,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:11,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:11,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:11,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 10:04:11,566 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-08 10:04:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:11,566 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 10:04:11,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:11,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 10:04:11,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 10:04:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:11,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:11,946 INFO L499 BasicCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:11,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:12,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:12,161 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:12,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash 868884524, now seen corresponding path program 119 times [2022-04-08 10:04:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:12,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287549665] [2022-04-08 10:04:12,164 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:12,164 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash 868884524, now seen corresponding path program 120 times [2022-04-08 10:04:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:12,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283227416] [2022-04-08 10:04:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:12,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {34142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {34120#true} is VALID [2022-04-08 10:04:12,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-08 10:04:12,408 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-08 10:04:12,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {34120#true} call ULTIMATE.init(); {34142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:12,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {34142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {34120#true} is VALID [2022-04-08 10:04:12,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-08 10:04:12,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-08 10:04:12,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {34120#true} call #t~ret9 := main(); {34120#true} is VALID [2022-04-08 10:04:12,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {34120#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34125#(= main_~y~0 0)} is VALID [2022-04-08 10:04:12,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {34125#(= 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; {34126#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:12,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {34126#(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; {34127#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:12,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {34127#(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; {34128#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:12,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {34128#(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; {34129#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:12,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {34129#(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; {34130#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:12,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {34130#(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; {34131#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:12,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {34131#(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; {34132#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:12,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {34132#(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; {34133#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:12,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {34133#(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; {34134#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:12,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {34134#(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; {34135#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:12,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {34135#(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; {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:12,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:12,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {34137#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:12,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {34137#(and (<= main_~z~0 11) (<= 11 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; {34138#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:12,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {34138#(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; {34139#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:12,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {34139#(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; {34140#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:12,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {34140#(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; {34141#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:12,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {34141#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34121#false} is VALID [2022-04-08 10:04:12,417 INFO L272 TraceCheckUtils]: 24: Hoare triple {34121#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34121#false} is VALID [2022-04-08 10:04:12,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {34121#false} ~cond := #in~cond; {34121#false} is VALID [2022-04-08 10:04:12,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {34121#false} assume 0 == ~cond; {34121#false} is VALID [2022-04-08 10:04:12,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {34121#false} assume !false; {34121#false} is VALID [2022-04-08 10:04:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:12,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283227416] [2022-04-08 10:04:12,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283227416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:12,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632052918] [2022-04-08 10:04:12,418 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:12,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:12,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:12,419 INFO L229 MonitoredProcess]: Starting monitored process 75 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:04:12,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-08 10:04:12,516 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:04:12,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:12,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:12,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:12,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {34120#true} call ULTIMATE.init(); {34120#true} is VALID [2022-04-08 10:04:12,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {34120#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); {34120#true} is VALID [2022-04-08 10:04:12,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-08 10:04:12,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-08 10:04:12,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {34120#true} call #t~ret9 := main(); {34120#true} is VALID [2022-04-08 10:04:12,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {34120#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34125#(= main_~y~0 0)} is VALID [2022-04-08 10:04:12,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {34125#(= 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; {34126#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:12,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {34126#(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; {34127#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:12,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {34127#(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; {34128#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:12,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {34128#(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; {34129#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:12,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {34129#(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; {34130#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:12,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {34130#(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; {34131#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:12,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {34131#(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; {34132#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:12,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {34132#(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; {34133#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:12,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {34133#(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; {34134#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:12,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {34134#(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; {34135#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:12,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {34135#(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; {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:12,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:12,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {34136#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {34137#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:12,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {34137#(and (<= main_~z~0 11) (<= 11 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; {34138#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:12,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {34138#(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; {34139#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:12,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {34139#(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; {34140#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:12,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {34140#(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; {34212#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:12,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {34212#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {34121#false} is VALID [2022-04-08 10:04:12,722 INFO L272 TraceCheckUtils]: 24: Hoare triple {34121#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34121#false} is VALID [2022-04-08 10:04:12,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {34121#false} ~cond := #in~cond; {34121#false} is VALID [2022-04-08 10:04:12,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {34121#false} assume 0 == ~cond; {34121#false} is VALID [2022-04-08 10:04:12,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {34121#false} assume !false; {34121#false} is VALID [2022-04-08 10:04:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:12,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:13,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {34121#false} assume !false; {34121#false} is VALID [2022-04-08 10:04:13,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {34121#false} assume 0 == ~cond; {34121#false} is VALID [2022-04-08 10:04:13,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {34121#false} ~cond := #in~cond; {34121#false} is VALID [2022-04-08 10:04:13,138 INFO L272 TraceCheckUtils]: 24: Hoare triple {34121#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34121#false} is VALID [2022-04-08 10:04:13,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {34240#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34121#false} is VALID [2022-04-08 10:04:13,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {34244#(< 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; {34240#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:13,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {34248#(< 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; {34244#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:13,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {34252#(< 0 (mod (+ main_~z~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; {34248#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:13,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {34256#(< 0 (mod (+ 4294967292 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; {34252#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:13,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {34260#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {34256#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:13,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {34260#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34260#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:13,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {34267#(< 0 (mod (+ main_~y~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; {34260#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:13,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {34271#(< 0 (mod (+ main_~y~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; {34267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:13,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {34275#(< 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; {34271#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:13,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {34279#(< 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; {34275#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:13,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {34283#(< 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; {34279#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:13,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {34287#(< 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; {34283#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:13,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {34291#(< 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; {34287#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:13,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {34295#(< 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; {34291#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:13,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {34299#(< 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; {34295#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:13,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {34303#(< 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; {34299#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:13,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {34307#(< 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; {34303#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:13,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {34120#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34307#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:13,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {34120#true} call #t~ret9 := main(); {34120#true} is VALID [2022-04-08 10:04:13,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34120#true} {34120#true} #50#return; {34120#true} is VALID [2022-04-08 10:04:13,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {34120#true} assume true; {34120#true} is VALID [2022-04-08 10:04:13,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {34120#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); {34120#true} is VALID [2022-04-08 10:04:13,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {34120#true} call ULTIMATE.init(); {34120#true} is VALID [2022-04-08 10:04:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:13,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632052918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:13,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:13,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:13,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:13,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287549665] [2022-04-08 10:04:13,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287549665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:13,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:13,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:13,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854961323] [2022-04-08 10:04:13,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:13,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:13,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:13,161 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:04:13,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:13,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:13,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:13,161 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,333 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-04-08 10:04:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:04:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 66 transitions. [2022-04-08 10:04:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 66 transitions. [2022-04-08 10:04:15,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 66 transitions. [2022-04-08 10:04:15,382 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:04:15,382 INFO L225 Difference]: With dead ends: 78 [2022-04-08 10:04:15,382 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 10:04:15,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=776, Invalid=3256, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:04:15,383 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:15,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 105 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:04:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 10:04:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2022-04-08 10:04:15,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:15,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,736 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,736 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,737 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-08 10:04:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-08 10:04:15,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:15,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:15,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 73 states. [2022-04-08 10:04:15,737 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 73 states. [2022-04-08 10:04:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,738 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-08 10:04:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-08 10:04:15,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:15,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:15,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:15,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 10:04:15,739 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-08 10:04:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:15,739 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 10:04:15,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:15,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 10:04:16,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 10:04:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:16,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:16,148 INFO L499 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:16,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:16,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:16,359 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1836251115, now seen corresponding path program 121 times [2022-04-08 10:04:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:16,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507667719] [2022-04-08 10:04:16,362 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:16,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:16,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1836251115, now seen corresponding path program 122 times [2022-04-08 10:04:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:16,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437923704] [2022-04-08 10:04:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {34792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {34770#true} is VALID [2022-04-08 10:04:16,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-08 10:04:16,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-08 10:04:16,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {34770#true} call ULTIMATE.init(); {34792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:16,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {34792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {34770#true} is VALID [2022-04-08 10:04:16,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-08 10:04:16,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-08 10:04:16,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {34770#true} call #t~ret9 := main(); {34770#true} is VALID [2022-04-08 10:04:16,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {34770#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34775#(= main_~y~0 0)} is VALID [2022-04-08 10:04:16,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {34775#(= 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; {34776#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:16,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {34776#(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; {34777#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:16,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {34777#(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; {34778#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:16,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {34778#(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; {34779#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:16,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {34779#(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; {34780#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:16,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {34780#(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; {34781#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:16,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {34781#(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; {34782#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {34782#(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; {34783#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:16,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {34783#(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; {34784#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:16,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {34784#(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; {34785#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:16,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {34785#(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; {34786#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:16,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {34786#(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; {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {34788#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:16,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {34788#(and (<= main_~z~0 12) (<= 12 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; {34789#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:16,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {34789#(and (<= main_~z~0 11) (<= 11 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; {34790#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:16,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {34790#(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; {34791#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:16,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {34791#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34771#false} is VALID [2022-04-08 10:04:16,622 INFO L272 TraceCheckUtils]: 24: Hoare triple {34771#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34771#false} is VALID [2022-04-08 10:04:16,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {34771#false} ~cond := #in~cond; {34771#false} is VALID [2022-04-08 10:04:16,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {34771#false} assume 0 == ~cond; {34771#false} is VALID [2022-04-08 10:04:16,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {34771#false} assume !false; {34771#false} is VALID [2022-04-08 10:04:16,622 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:04:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:16,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437923704] [2022-04-08 10:04:16,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437923704] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:16,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901640392] [2022-04-08 10:04:16,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:16,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:16,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:16,623 INFO L229 MonitoredProcess]: Starting monitored process 76 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:04:16,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-08 10:04:16,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:16,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:16,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:16,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {34770#true} call ULTIMATE.init(); {34770#true} is VALID [2022-04-08 10:04:16,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {34770#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); {34770#true} is VALID [2022-04-08 10:04:16,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-08 10:04:16,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-08 10:04:16,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {34770#true} call #t~ret9 := main(); {34770#true} is VALID [2022-04-08 10:04:16,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {34770#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34775#(= main_~y~0 0)} is VALID [2022-04-08 10:04:16,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {34775#(= 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; {34776#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:16,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {34776#(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; {34777#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:16,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {34777#(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; {34778#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:16,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {34778#(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; {34779#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:16,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {34779#(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; {34780#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:16,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {34780#(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; {34781#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:16,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {34781#(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; {34782#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {34782#(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; {34783#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:16,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {34783#(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; {34784#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:16,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {34784#(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; {34785#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:16,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {34785#(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; {34786#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:16,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {34786#(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; {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {34787#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {34788#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:16,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {34788#(and (<= main_~z~0 12) (<= 12 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; {34789#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:16,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {34789#(and (<= main_~z~0 11) (<= 11 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; {34790#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:16,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {34790#(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; {34862#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:16,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {34862#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {34771#false} is VALID [2022-04-08 10:04:16,879 INFO L272 TraceCheckUtils]: 24: Hoare triple {34771#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34771#false} is VALID [2022-04-08 10:04:16,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {34771#false} ~cond := #in~cond; {34771#false} is VALID [2022-04-08 10:04:16,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {34771#false} assume 0 == ~cond; {34771#false} is VALID [2022-04-08 10:04:16,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {34771#false} assume !false; {34771#false} is VALID [2022-04-08 10:04:16,879 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:04:16,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:17,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {34771#false} assume !false; {34771#false} is VALID [2022-04-08 10:04:17,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {34771#false} assume 0 == ~cond; {34771#false} is VALID [2022-04-08 10:04:17,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {34771#false} ~cond := #in~cond; {34771#false} is VALID [2022-04-08 10:04:17,372 INFO L272 TraceCheckUtils]: 24: Hoare triple {34771#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34771#false} is VALID [2022-04-08 10:04:17,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {34890#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34771#false} is VALID [2022-04-08 10:04:17,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {34894#(< 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; {34890#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:17,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {34898#(< 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; {34894#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:17,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {34902#(< 0 (mod (+ main_~z~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; {34898#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:17,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {34906#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {34902#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:17,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {34906#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34906#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:17,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {34913#(< 0 (mod (+ main_~y~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; {34906#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:17,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {34917#(< 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; {34913#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:17,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {34921#(< 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; {34917#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:17,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {34925#(< 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; {34921#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:17,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {34929#(< 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; {34925#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:17,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {34933#(< 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; {34929#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:17,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {34937#(< 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; {34933#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:17,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {34941#(< 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; {34937#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:17,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {34945#(< 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; {34941#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:17,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {34949#(< 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; {34945#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:17,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {34953#(< 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; {34949#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:17,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {34957#(< 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; {34953#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:17,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {34770#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34957#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:17,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {34770#true} call #t~ret9 := main(); {34770#true} is VALID [2022-04-08 10:04:17,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34770#true} {34770#true} #50#return; {34770#true} is VALID [2022-04-08 10:04:17,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {34770#true} assume true; {34770#true} is VALID [2022-04-08 10:04:17,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {34770#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); {34770#true} is VALID [2022-04-08 10:04:17,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {34770#true} call ULTIMATE.init(); {34770#true} is VALID [2022-04-08 10:04:17,381 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:04:17,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901640392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:17,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:17,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:17,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:17,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507667719] [2022-04-08 10:04:17,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507667719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:17,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:17,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454503282] [2022-04-08 10:04:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:17,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:17,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:17,394 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:04:17,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:17,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:17,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:17,395 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:19,344 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2022-04-08 10:04:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:04:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-08 10:04:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-08 10:04:19,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2022-04-08 10:04:19,383 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:04:19,384 INFO L225 Difference]: With dead ends: 83 [2022-04-08 10:04:19,384 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 10:04:19,384 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=721, Invalid=2939, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:04:19,384 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:19,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 104 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 10:04:19,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 44. [2022-04-08 10:04:19,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:19,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:19,614 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:19,614 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:19,615 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-08 10:04:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-08 10:04:19,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:19,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:19,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 78 states. [2022-04-08 10:04:19,615 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 78 states. [2022-04-08 10:04:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:19,616 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-08 10:04:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-08 10:04:19,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:19,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:19,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:19,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 10:04:19,616 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-08 10:04:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:19,617 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 10:04:19,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:19,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 10:04:20,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 10:04:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:20,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:20,036 INFO L499 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:20,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:20,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-04-08 10:04:20,251 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash 897625164, now seen corresponding path program 123 times [2022-04-08 10:04:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:20,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734481890] [2022-04-08 10:04:20,253 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:20,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash 897625164, now seen corresponding path program 124 times [2022-04-08 10:04:20,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:20,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888105715] [2022-04-08 10:04:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:20,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {35456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {35434#true} is VALID [2022-04-08 10:04:20,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-08 10:04:20,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-08 10:04:20,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {35434#true} call ULTIMATE.init(); {35456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:20,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {35456#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {35434#true} is VALID [2022-04-08 10:04:20,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-08 10:04:20,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-08 10:04:20,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {35434#true} call #t~ret9 := main(); {35434#true} is VALID [2022-04-08 10:04:20,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {35434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35439#(= main_~y~0 0)} is VALID [2022-04-08 10:04:20,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {35439#(= 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; {35440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:20,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {35440#(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; {35441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:20,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {35441#(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; {35442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:20,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {35442#(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; {35443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:20,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {35443#(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; {35444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:20,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {35444#(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; {35445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:20,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {35445#(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; {35446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:20,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {35446#(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; {35447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:20,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {35447#(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; {35448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:20,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {35448#(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; {35449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:20,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {35449#(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; {35450#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:20,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {35450#(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; {35451#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:20,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {35451#(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; {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:20,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:20,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {35453#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:04:20,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {35453#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35454#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:20,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {35454#(and (<= main_~z~0 12) (<= 12 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; {35455#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:20,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {35455#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35435#false} is VALID [2022-04-08 10:04:20,452 INFO L272 TraceCheckUtils]: 24: Hoare triple {35435#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35435#false} is VALID [2022-04-08 10:04:20,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {35435#false} ~cond := #in~cond; {35435#false} is VALID [2022-04-08 10:04:20,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {35435#false} assume 0 == ~cond; {35435#false} is VALID [2022-04-08 10:04:20,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {35435#false} assume !false; {35435#false} is VALID [2022-04-08 10:04:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:20,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:20,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888105715] [2022-04-08 10:04:20,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888105715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:20,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999660354] [2022-04-08 10:04:20,452 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:20,453 INFO L229 MonitoredProcess]: Starting monitored process 77 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:04:20,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-08 10:04:20,508 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:20,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:20,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:20,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:20,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {35434#true} call ULTIMATE.init(); {35434#true} is VALID [2022-04-08 10:04:20,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {35434#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); {35434#true} is VALID [2022-04-08 10:04:20,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-08 10:04:20,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-08 10:04:20,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {35434#true} call #t~ret9 := main(); {35434#true} is VALID [2022-04-08 10:04:20,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {35434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35439#(= main_~y~0 0)} is VALID [2022-04-08 10:04:20,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {35439#(= 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; {35440#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:20,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {35440#(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; {35441#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:20,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {35441#(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; {35442#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:20,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {35442#(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; {35443#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:20,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {35443#(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; {35444#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:20,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {35444#(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; {35445#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:20,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {35445#(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; {35446#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:20,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {35446#(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; {35447#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:20,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {35447#(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; {35448#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:20,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {35448#(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; {35449#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:20,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {35449#(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; {35450#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:20,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {35450#(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; {35451#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:20,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {35451#(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; {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:20,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:20,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {35452#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {35453#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:04:20,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {35453#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35454#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:20,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {35454#(and (<= main_~z~0 12) (<= 12 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; {35526#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:20,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {35526#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35435#false} is VALID [2022-04-08 10:04:20,680 INFO L272 TraceCheckUtils]: 24: Hoare triple {35435#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35435#false} is VALID [2022-04-08 10:04:20,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {35435#false} ~cond := #in~cond; {35435#false} is VALID [2022-04-08 10:04:20,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {35435#false} assume 0 == ~cond; {35435#false} is VALID [2022-04-08 10:04:20,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {35435#false} assume !false; {35435#false} is VALID [2022-04-08 10:04:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:20,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:21,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {35435#false} assume !false; {35435#false} is VALID [2022-04-08 10:04:21,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {35435#false} assume 0 == ~cond; {35435#false} is VALID [2022-04-08 10:04:21,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {35435#false} ~cond := #in~cond; {35435#false} is VALID [2022-04-08 10:04:21,015 INFO L272 TraceCheckUtils]: 24: Hoare triple {35435#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35435#false} is VALID [2022-04-08 10:04:21,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {35554#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35435#false} is VALID [2022-04-08 10:04:21,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {35558#(< 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; {35554#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:21,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {35562#(< 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; {35558#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:21,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {35566#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35562#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:21,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {35566#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35566#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:21,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {35573#(< 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; {35566#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:21,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {35577#(< 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; {35573#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:21,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {35581#(< 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; {35577#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:21,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {35585#(< 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; {35581#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:21,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {35589#(< 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; {35585#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:21,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {35593#(< 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; {35589#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:21,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {35597#(< 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; {35593#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:21,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {35601#(< 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; {35597#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:21,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {35605#(< 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; {35601#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:21,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {35609#(< 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; {35605#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:21,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {35613#(< 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; {35609#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:21,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {35617#(< 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; {35613#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:21,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {35621#(< 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; {35617#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:21,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {35434#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35621#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:21,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {35434#true} call #t~ret9 := main(); {35434#true} is VALID [2022-04-08 10:04:21,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35434#true} {35434#true} #50#return; {35434#true} is VALID [2022-04-08 10:04:21,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {35434#true} assume true; {35434#true} is VALID [2022-04-08 10:04:21,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {35434#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); {35434#true} is VALID [2022-04-08 10:04:21,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {35434#true} call ULTIMATE.init(); {35434#true} is VALID [2022-04-08 10:04:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:21,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999660354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:21,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:21,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:21,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:21,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734481890] [2022-04-08 10:04:21,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734481890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:21,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:21,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:21,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614848221] [2022-04-08 10:04:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:21,025 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:21,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:21,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:21,037 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:04:21,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:21,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:21,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:21,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:21,038 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:23,047 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-08 10:04:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:04:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-08 10:04:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 70 transitions. [2022-04-08 10:04:23,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 70 transitions. [2022-04-08 10:04:23,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:23,085 INFO L225 Difference]: With dead ends: 87 [2022-04-08 10:04:23,085 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 10:04:23,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=674, Invalid=2632, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:04:23,085 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:23,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 119 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:04:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 10:04:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 44. [2022-04-08 10:04:23,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:23,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:23,430 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:23,430 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:23,430 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-04-08 10:04:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2022-04-08 10:04:23,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:23,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:23,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 82 states. [2022-04-08 10:04:23,431 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 82 states. [2022-04-08 10:04:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:23,431 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-04-08 10:04:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2022-04-08 10:04:23,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:23,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:23,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:23,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 10:04:23,432 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-08 10:04:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:23,432 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 10:04:23,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:23,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 10:04:23,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 10:04:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:23,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:23,889 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:23,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:24,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-04-08 10:04:24,104 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash 313157579, now seen corresponding path program 125 times [2022-04-08 10:04:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:24,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [680153633] [2022-04-08 10:04:24,111 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:24,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash 313157579, now seen corresponding path program 126 times [2022-04-08 10:04:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:24,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239232487] [2022-04-08 10:04:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:24,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {36130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {36108#true} is VALID [2022-04-08 10:04:24,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-08 10:04:24,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-08 10:04:24,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {36108#true} call ULTIMATE.init(); {36130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:24,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {36130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {36108#true} is VALID [2022-04-08 10:04:24,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-08 10:04:24,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-08 10:04:24,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {36108#true} call #t~ret9 := main(); {36108#true} is VALID [2022-04-08 10:04:24,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {36108#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36113#(= main_~y~0 0)} is VALID [2022-04-08 10:04:24,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {36113#(= 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; {36114#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:24,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {36114#(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; {36115#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:24,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {36115#(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; {36116#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:24,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {36116#(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; {36117#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:24,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {36117#(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; {36118#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:24,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {36118#(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; {36119#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:24,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {36119#(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; {36120#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:24,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {36120#(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; {36121#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:24,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {36121#(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; {36122#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:24,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {36122#(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; {36123#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:24,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {36123#(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; {36124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:24,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {36124#(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; {36125#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:24,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {36125#(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; {36126#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:24,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {36126#(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; {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:24,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:24,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {36128#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:04:24,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {36128#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36129#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:24,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {36129#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {36109#false} is VALID [2022-04-08 10:04:24,348 INFO L272 TraceCheckUtils]: 24: Hoare triple {36109#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36109#false} is VALID [2022-04-08 10:04:24,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {36109#false} ~cond := #in~cond; {36109#false} is VALID [2022-04-08 10:04:24,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {36109#false} assume 0 == ~cond; {36109#false} is VALID [2022-04-08 10:04:24,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {36109#false} assume !false; {36109#false} is VALID [2022-04-08 10:04:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:24,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:24,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239232487] [2022-04-08 10:04:24,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239232487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:24,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132235533] [2022-04-08 10:04:24,348 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:24,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:24,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:24,349 INFO L229 MonitoredProcess]: Starting monitored process 78 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:04:24,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-08 10:04:24,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:04:24,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:24,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:24,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:24,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {36108#true} call ULTIMATE.init(); {36108#true} is VALID [2022-04-08 10:04:24,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {36108#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); {36108#true} is VALID [2022-04-08 10:04:24,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-08 10:04:24,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-08 10:04:24,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {36108#true} call #t~ret9 := main(); {36108#true} is VALID [2022-04-08 10:04:24,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {36108#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36113#(= main_~y~0 0)} is VALID [2022-04-08 10:04:24,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {36113#(= 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; {36114#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:24,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {36114#(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; {36115#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:24,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {36115#(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; {36116#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:24,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {36116#(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; {36117#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:24,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {36117#(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; {36118#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:24,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {36118#(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; {36119#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:24,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {36119#(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; {36120#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:24,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {36120#(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; {36121#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:24,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {36121#(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; {36122#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:24,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {36122#(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; {36123#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:24,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {36123#(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; {36124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:24,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {36124#(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; {36125#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:24,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {36125#(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; {36126#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:24,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {36126#(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; {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:24,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:24,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {36127#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {36128#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:04:24,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {36128#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36200#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:04:24,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {36200#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {36109#false} is VALID [2022-04-08 10:04:24,654 INFO L272 TraceCheckUtils]: 24: Hoare triple {36109#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36109#false} is VALID [2022-04-08 10:04:24,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {36109#false} ~cond := #in~cond; {36109#false} is VALID [2022-04-08 10:04:24,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {36109#false} assume 0 == ~cond; {36109#false} is VALID [2022-04-08 10:04:24,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {36109#false} assume !false; {36109#false} is VALID [2022-04-08 10:04:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:24,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:25,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {36109#false} assume !false; {36109#false} is VALID [2022-04-08 10:04:25,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {36109#false} assume 0 == ~cond; {36109#false} is VALID [2022-04-08 10:04:25,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {36109#false} ~cond := #in~cond; {36109#false} is VALID [2022-04-08 10:04:25,102 INFO L272 TraceCheckUtils]: 24: Hoare triple {36109#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36109#false} is VALID [2022-04-08 10:04:25,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {36228#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36109#false} is VALID [2022-04-08 10:04:25,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {36232#(< 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; {36228#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:25,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {36236#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {36232#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:25,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {36236#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {36236#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:25,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {36243#(< 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; {36236#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:25,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {36247#(< 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; {36243#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:25,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {36251#(< 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; {36247#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:25,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {36255#(< 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; {36251#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:25,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {36259#(< 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; {36255#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:25,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {36263#(< 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; {36259#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:25,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {36267#(< 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; {36263#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:25,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {36271#(< 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; {36267#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:25,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {36275#(< 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; {36271#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:25,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {36279#(< 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; {36275#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:25,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {36283#(< 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; {36279#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:25,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {36287#(< 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; {36283#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:25,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {36291#(< 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; {36287#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:25,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {36295#(< 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; {36291#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:25,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {36108#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36295#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:04:25,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {36108#true} call #t~ret9 := main(); {36108#true} is VALID [2022-04-08 10:04:25,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36108#true} {36108#true} #50#return; {36108#true} is VALID [2022-04-08 10:04:25,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {36108#true} assume true; {36108#true} is VALID [2022-04-08 10:04:25,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {36108#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); {36108#true} is VALID [2022-04-08 10:04:25,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {36108#true} call ULTIMATE.init(); {36108#true} is VALID [2022-04-08 10:04:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:25,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132235533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:25,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:25,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:25,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:25,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [680153633] [2022-04-08 10:04:25,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [680153633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:25,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:25,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707798544] [2022-04-08 10:04:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:25,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:25,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:25,130 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:04:25,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:25,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:25,131 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:27,449 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-04-08 10:04:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:04:27,449 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 73 transitions. [2022-04-08 10:04:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 73 transitions. [2022-04-08 10:04:27,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 73 transitions. [2022-04-08 10:04:27,491 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:04:27,492 INFO L225 Difference]: With dead ends: 90 [2022-04-08 10:04:27,492 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 10:04:27,492 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=658, Invalid=2422, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:04:27,493 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:27,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 124 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:04:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 10:04:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 44. [2022-04-08 10:04:27,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:27,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:27,716 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:27,716 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:27,716 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-04-08 10:04:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2022-04-08 10:04:27,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:27,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:27,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 85 states. [2022-04-08 10:04:27,717 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 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 85 states. [2022-04-08 10:04:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:27,717 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-04-08 10:04:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2022-04-08 10:04:27,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:27,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:27,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:27,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-04-08 10:04:27,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 28 [2022-04-08 10:04:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:27,718 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-04-08 10:04:27,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:27,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 52 transitions. [2022-04-08 10:04:28,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-08 10:04:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:28,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:28,151 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:28,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:28,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:28,364 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1783906196, now seen corresponding path program 29 times [2022-04-08 10:04:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:28,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619149889] [2022-04-08 10:04:28,366 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:28,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1783906196, now seen corresponding path program 30 times [2022-04-08 10:04:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:28,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007758743] [2022-04-08 10:04:28,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:28,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:28,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {36812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {36790#true} is VALID [2022-04-08 10:04:28,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-08 10:04:28,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-08 10:04:28,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {36790#true} call ULTIMATE.init(); {36812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:28,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {36812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {36790#true} is VALID [2022-04-08 10:04:28,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-08 10:04:28,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-08 10:04:28,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {36790#true} call #t~ret9 := main(); {36790#true} is VALID [2022-04-08 10:04:28,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {36790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36795#(= main_~y~0 0)} is VALID [2022-04-08 10:04:28,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {36795#(= 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; {36796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:28,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {36796#(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; {36797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:28,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {36797#(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; {36798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:28,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {36798#(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; {36799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:28,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {36799#(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; {36800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:28,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {36800#(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; {36801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:28,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {36801#(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; {36802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:28,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {36802#(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; {36803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:28,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {36803#(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; {36804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:28,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {36804#(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; {36805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:28,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {36805#(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; {36806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:28,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {36806#(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; {36807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:28,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {36807#(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; {36808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:28,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {36808#(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; {36809#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:28,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {36809#(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; {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:28,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {36811#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {36811#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {36791#false} is VALID [2022-04-08 10:04:28,649 INFO L272 TraceCheckUtils]: 24: Hoare triple {36791#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36791#false} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {36791#false} ~cond := #in~cond; {36791#false} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {36791#false} assume 0 == ~cond; {36791#false} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {36791#false} assume !false; {36791#false} is VALID [2022-04-08 10:04:28,649 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:04:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007758743] [2022-04-08 10:04:28,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007758743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558446582] [2022-04-08 10:04:28,650 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:28,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:28,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:28,651 INFO L229 MonitoredProcess]: Starting monitored process 79 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:04:28,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-08 10:04:28,845 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:04:28,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:28,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:28,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:29,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {36790#true} call ULTIMATE.init(); {36790#true} is VALID [2022-04-08 10:04:29,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {36790#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); {36790#true} is VALID [2022-04-08 10:04:29,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-08 10:04:29,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-08 10:04:29,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {36790#true} call #t~ret9 := main(); {36790#true} is VALID [2022-04-08 10:04:29,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {36790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36795#(= main_~y~0 0)} is VALID [2022-04-08 10:04:29,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {36795#(= 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; {36796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:29,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {36796#(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; {36797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:29,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {36797#(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; {36798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:29,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {36798#(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; {36799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:29,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {36799#(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; {36800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:29,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {36800#(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; {36801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:29,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {36801#(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; {36802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:29,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {36802#(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; {36803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:29,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {36803#(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; {36804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:29,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {36804#(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; {36805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:29,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {36805#(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; {36806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:29,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {36806#(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; {36807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:29,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {36807#(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; {36808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:29,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {36808#(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; {36809#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:29,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {36809#(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; {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:29,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:29,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {36810#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {36882#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:29,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {36882#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {36791#false} is VALID [2022-04-08 10:04:29,133 INFO L272 TraceCheckUtils]: 24: Hoare triple {36791#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36791#false} is VALID [2022-04-08 10:04:29,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {36791#false} ~cond := #in~cond; {36791#false} is VALID [2022-04-08 10:04:29,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {36791#false} assume 0 == ~cond; {36791#false} is VALID [2022-04-08 10:04:29,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {36791#false} assume !false; {36791#false} is VALID [2022-04-08 10:04:29,133 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:04:29,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:29,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {36791#false} assume !false; {36791#false} is VALID [2022-04-08 10:04:29,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {36791#false} assume 0 == ~cond; {36791#false} is VALID [2022-04-08 10:04:29,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {36791#false} ~cond := #in~cond; {36791#false} is VALID [2022-04-08 10:04:29,644 INFO L272 TraceCheckUtils]: 24: Hoare triple {36791#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36791#false} is VALID [2022-04-08 10:04:29,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {36910#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36791#false} is VALID [2022-04-08 10:04:29,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {36914#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {36910#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:29,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {36914#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {36914#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:29,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {36921#(< 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; {36914#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:29,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {36925#(< 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; {36921#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:29,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {36929#(< 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; {36925#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:29,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {36933#(< 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; {36929#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:29,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {36937#(< 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; {36933#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:29,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {36941#(< 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; {36937#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:29,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {36945#(< 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; {36941#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:29,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {36949#(< 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; {36945#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:29,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {36953#(< 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; {36949#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:29,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {36957#(< 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; {36953#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:29,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {36961#(< 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; {36957#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:29,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {36965#(< 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; {36961#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:29,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {36969#(< 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; {36965#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:29,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {36973#(< 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; {36969#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:04:29,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {36977#(< 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; {36973#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:04:29,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {36790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36977#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:04:29,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {36790#true} call #t~ret9 := main(); {36790#true} is VALID [2022-04-08 10:04:29,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36790#true} {36790#true} #50#return; {36790#true} is VALID [2022-04-08 10:04:29,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {36790#true} assume true; {36790#true} is VALID [2022-04-08 10:04:29,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {36790#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); {36790#true} is VALID [2022-04-08 10:04:29,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {36790#true} call ULTIMATE.init(); {36790#true} is VALID [2022-04-08 10:04:29,655 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:04:29,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558446582] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:29,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:29,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:29,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:29,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619149889] [2022-04-08 10:04:29,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619149889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:29,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:29,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:29,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227868933] [2022-04-08 10:04:29,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:29,656 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:29,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:29,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:29,673 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:04:29,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:29,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:29,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:29,674 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,237 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2022-04-08 10:04:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:04:32,237 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-08 10:04:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-08 10:04:32,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-04-08 10:04:32,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:32,296 INFO L225 Difference]: With dead ends: 95 [2022-04-08 10:04:32,296 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 10:04:32,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 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:04:32,296 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:32,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 127 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:04:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 10:04:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 46. [2022-04-08 10:04:32,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:32,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,628 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,628 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,629 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2022-04-08 10:04:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2022-04-08 10:04:32,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:32,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:32,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 3 states have call successors, (3), 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 90 states. [2022-04-08 10:04:32,629 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 3 states have call successors, (3), 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 90 states. [2022-04-08 10:04:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,630 INFO L93 Difference]: Finished difference Result 90 states and 107 transitions. [2022-04-08 10:04:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2022-04-08 10:04:32,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:32,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:32,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:32,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-04-08 10:04:32,630 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 28 [2022-04-08 10:04:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:32,631 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-04-08 10:04:32,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 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:04:32,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 55 transitions. [2022-04-08 10:04:33,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 10:04:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:33,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:33,065 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:33,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-04-08 10:04:33,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:33,268 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash -412950633, now seen corresponding path program 127 times [2022-04-08 10:04:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:33,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469486016] [2022-04-08 10:04:33,271 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:33,271 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash -412950633, now seen corresponding path program 128 times [2022-04-08 10:04:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:33,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428168518] [2022-04-08 10:04:33,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:33,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {37519#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {37494#true} is VALID [2022-04-08 10:04:33,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-08 10:04:33,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-08 10:04:33,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {37494#true} call ULTIMATE.init(); {37519#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:33,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {37519#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {37494#true} is VALID [2022-04-08 10:04:33,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-08 10:04:33,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-08 10:04:33,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {37494#true} call #t~ret9 := main(); {37494#true} is VALID [2022-04-08 10:04:33,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {37494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:04:33,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37500#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:04:33,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {37500#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {37501#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:04:33,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {37501#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~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; {37502#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:04:33,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {37502#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= 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; {37503#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:04:33,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {37503#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37504#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:04:33,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {37504#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= 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; {37505#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:04:33,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {37505#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37506#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:04:33,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {37506#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37507#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 8)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:04:33,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {37507#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 8)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {37508#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:04:33,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {37508#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {37508#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:04:33,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {37508#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {37509#(and (<= (+ 1 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:04:33,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {37509#(and (<= (+ 1 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= main_~n~0 (+ 7 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; {37510#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 2 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-08 10:04:33,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {37510#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 2 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {37511#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0))} is VALID [2022-04-08 10:04:33,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {37511#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 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; {37512#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 4) main_~x~0))} is VALID [2022-04-08 10:04:33,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {37512#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 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; {37513#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 5) main_~x~0))} is VALID [2022-04-08 10:04:33,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {37513#(and (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 5) 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; {37514#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:04:33,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {37514#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 6) main_~x~0) (<= main_~n~0 (+ main_~x~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; {37515#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ 7 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:04:33,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {37515#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ 7 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~x~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; {37516#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:04:33,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {37516#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {37516#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:04:33,991 INFO L272 TraceCheckUtils]: 25: Hoare triple {37516#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37517#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:04:33,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {37517#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37518#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:04:33,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {37518#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37495#false} is VALID [2022-04-08 10:04:33,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {37495#false} assume !false; {37495#false} is VALID [2022-04-08 10:04:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:33,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428168518] [2022-04-08 10:04:33,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428168518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:33,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053181820] [2022-04-08 10:04:33,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:33,993 INFO L229 MonitoredProcess]: Starting monitored process 80 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:04:33,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-04-08 10:04:34,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:34,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:34,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:04:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:34,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:34,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {37494#true} call ULTIMATE.init(); {37494#true} is VALID [2022-04-08 10:04:34,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {37494#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); {37494#true} is VALID [2022-04-08 10:04:34,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-08 10:04:34,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-08 10:04:34,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {37494#true} call #t~ret9 := main(); {37494#true} is VALID [2022-04-08 10:04:34,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {37494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:04:34,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37541#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:04:34,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {37541#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37545#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:04:34,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {37545#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37549#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:04:34,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {37549#(= (+ (- 2) main_~n~0) (+ main_~x~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; {37553#(= (+ (- 2) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:04:34,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {37553#(= (+ (- 2) main_~n~0) (+ main_~x~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; {37557#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} is VALID [2022-04-08 10:04:34,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {37557#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37561#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:04:34,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {37561#(= (+ main_~x~0 1) (+ main_~n~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; {37565#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:04:34,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {37565#(= (+ main_~x~0 2) (+ main_~n~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; {37569#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} is VALID [2022-04-08 10:04:34,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {37569#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} assume !(~x~0 % 4294967296 > 0); {37569#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} is VALID [2022-04-08 10:04:34,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {37569#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} ~z~0 := ~y~0; {37569#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} is VALID [2022-04-08 10:04:34,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {37569#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37565#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:04:34,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {37565#(= (+ main_~x~0 2) (+ main_~n~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37561#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:04:34,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {37561#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37557#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} is VALID [2022-04-08 10:04:34,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {37557#(= (+ (- 2) main_~n~0) (+ main_~x~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37553#(= (+ (- 2) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:04:34,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {37553#(= (+ (- 2) main_~n~0) (+ main_~x~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; {37549#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:04:34,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {37549#(= (+ (- 2) main_~n~0) (+ main_~x~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; {37545#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:04:34,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {37545#(= (+ main_~x~0 1) (+ (- 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; {37541#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:04:34,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {37541#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 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; {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:04:34,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:04:34,453 INFO L272 TraceCheckUtils]: 25: Hoare triple {37499#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:34,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {37606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:34,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {37610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37495#false} is VALID [2022-04-08 10:04:34,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {37495#false} assume !false; {37495#false} is VALID [2022-04-08 10:04:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:34,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:34,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {37495#false} assume !false; {37495#false} is VALID [2022-04-08 10:04:34,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {37610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37495#false} is VALID [2022-04-08 10:04:34,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {37606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:34,903 INFO L272 TraceCheckUtils]: 25: Hoare triple {37626#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:34,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {37626#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {37626#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:04:34,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {37633#(= (mod main_~n~0 4294967296) (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; {37626#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:04:34,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {37637#(= (mod main_~n~0 4294967296) (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; {37633#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:04:34,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {37641#(= (mod (+ main_~x~0 3) 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; {37637#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:04:34,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {37645#(= (mod main_~n~0 4294967296) (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; {37641#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:04:34,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {37649#(= (mod main_~n~0 4294967296) (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; {37645#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:04:34,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {37653#(= (mod main_~n~0 4294967296) (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; {37649#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:04:34,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {37657#(= (mod main_~n~0 4294967296) (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; {37653#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:04:34,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {37661#(= (mod main_~n~0 4294967296) (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; {37657#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:04:34,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {37661#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} ~z~0 := ~y~0; {37661#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:04:34,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {37661#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} assume !(~x~0 % 4294967296 > 0); {37661#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:04:34,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {37657#(= (mod main_~n~0 4294967296) (mod (+ 7 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; {37661#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:04:34,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {37653#(= (mod main_~n~0 4294967296) (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; {37657#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:04:34,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {37649#(= (mod main_~n~0 4294967296) (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; {37653#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:04:34,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {37645#(= (mod main_~n~0 4294967296) (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; {37649#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:04:34,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {37641#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~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; {37645#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:04:34,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {37637#(= (mod main_~n~0 4294967296) (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; {37641#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:04:34,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {37633#(= (mod main_~n~0 4294967296) (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; {37637#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:04:34,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {37626#(= (mod main_~n~0 4294967296) (mod 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; {37633#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:04:34,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {37494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37626#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:04:34,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {37494#true} call #t~ret9 := main(); {37494#true} is VALID [2022-04-08 10:04:34,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37494#true} {37494#true} #50#return; {37494#true} is VALID [2022-04-08 10:04:34,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {37494#true} assume true; {37494#true} is VALID [2022-04-08 10:04:34,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {37494#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); {37494#true} is VALID [2022-04-08 10:04:34,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {37494#true} call ULTIMATE.init(); {37494#true} is VALID [2022-04-08 10:04:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:34,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053181820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:34,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:34,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 42 [2022-04-08 10:04:34,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:34,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469486016] [2022-04-08 10:04:34,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469486016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:34,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:34,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:04:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487208038] [2022-04-08 10:04:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:04:34,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:34,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:34,950 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:04:34,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:04:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:34,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:04:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:04:34,951 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:36,842 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-08 10:04:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:04:36,842 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-08 10:04:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-08 10:04:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-08 10:04:36,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 40 transitions. [2022-04-08 10:04:36,875 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:04:36,876 INFO L225 Difference]: With dead ends: 59 [2022-04-08 10:04:36,876 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 10:04:36,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=262, Invalid=3398, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:04:36,876 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:36,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:04:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 10:04:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2022-04-08 10:04:37,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:37,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:37,150 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:37,150 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:37,150 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 10:04:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 10:04:37,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:37,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:37,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 54 states. [2022-04-08 10:04:37,151 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 54 states. [2022-04-08 10:04:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:37,151 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-04-08 10:04:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-08 10:04:37,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:37,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:37,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:37,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:04:37,152 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:04:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:37,152 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:04:37,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:37,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:04:37,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:04:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:37,813 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:37,813 INFO L499 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:37,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:38,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:38,014 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash -313802794, now seen corresponding path program 129 times [2022-04-08 10:04:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:38,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934738570] [2022-04-08 10:04:38,017 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:38,017 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash -313802794, now seen corresponding path program 130 times [2022-04-08 10:04:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:38,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233044718] [2022-04-08 10:04:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:38,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {38093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {38070#true} is VALID [2022-04-08 10:04:38,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-08 10:04:38,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-08 10:04:38,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {38070#true} call ULTIMATE.init(); {38093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:38,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {38093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {38070#true} is VALID [2022-04-08 10:04:38,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-08 10:04:38,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-08 10:04:38,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {38070#true} call #t~ret9 := main(); {38070#true} is VALID [2022-04-08 10:04:38,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {38070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38075#(= main_~y~0 0)} is VALID [2022-04-08 10:04:38,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {38075#(= 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; {38076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:38,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {38076#(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; {38077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:38,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {38077#(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; {38078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:38,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {38078#(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; {38079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:38,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {38079#(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; {38080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:38,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {38080#(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; {38081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:38,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {38081#(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; {38082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:38,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {38082#(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; {38083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:38,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {38083#(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; {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:38,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:38,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {38085#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:38,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {38085#(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; {38086#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:38,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {38086#(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; {38087#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:38,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {38087#(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; {38088#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:38,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {38088#(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; {38089#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:38,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {38089#(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; {38090#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:38,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {38090#(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; {38091#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:38,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {38091#(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; {38092#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:38,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {38092#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38071#false} is VALID [2022-04-08 10:04:38,322 INFO L272 TraceCheckUtils]: 25: Hoare triple {38071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38071#false} is VALID [2022-04-08 10:04:38,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {38071#false} ~cond := #in~cond; {38071#false} is VALID [2022-04-08 10:04:38,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {38071#false} assume 0 == ~cond; {38071#false} is VALID [2022-04-08 10:04:38,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {38071#false} assume !false; {38071#false} is VALID [2022-04-08 10:04:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:38,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233044718] [2022-04-08 10:04:38,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233044718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534319183] [2022-04-08 10:04:38,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:38,324 INFO L229 MonitoredProcess]: Starting monitored process 81 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:04:38,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-04-08 10:04:38,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:38,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:38,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:04:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:38,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:38,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {38070#true} call ULTIMATE.init(); {38070#true} is VALID [2022-04-08 10:04:38,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {38070#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); {38070#true} is VALID [2022-04-08 10:04:38,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-08 10:04:38,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-08 10:04:38,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {38070#true} call #t~ret9 := main(); {38070#true} is VALID [2022-04-08 10:04:38,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {38070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38075#(= main_~y~0 0)} is VALID [2022-04-08 10:04:38,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {38075#(= 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; {38076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:38,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {38076#(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; {38077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:38,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {38077#(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; {38078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:38,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {38078#(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; {38079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:38,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {38079#(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; {38080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:38,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {38080#(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; {38081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:38,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {38081#(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; {38082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:38,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {38082#(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; {38083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:38,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {38083#(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; {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:38,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:38,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {38084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {38085#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:38,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {38085#(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; {38086#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:38,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {38086#(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; {38087#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:38,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {38087#(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; {38088#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:38,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {38088#(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; {38089#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:38,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {38089#(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; {38090#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:38,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {38090#(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; {38091#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:38,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {38091#(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; {38166#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:38,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {38166#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38071#false} is VALID [2022-04-08 10:04:38,584 INFO L272 TraceCheckUtils]: 25: Hoare triple {38071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38071#false} is VALID [2022-04-08 10:04:38,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {38071#false} ~cond := #in~cond; {38071#false} is VALID [2022-04-08 10:04:38,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {38071#false} assume 0 == ~cond; {38071#false} is VALID [2022-04-08 10:04:38,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {38071#false} assume !false; {38071#false} is VALID [2022-04-08 10:04:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:38,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:39,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {38071#false} assume !false; {38071#false} is VALID [2022-04-08 10:04:39,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {38071#false} assume 0 == ~cond; {38071#false} is VALID [2022-04-08 10:04:39,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {38071#false} ~cond := #in~cond; {38071#false} is VALID [2022-04-08 10:04:39,000 INFO L272 TraceCheckUtils]: 25: Hoare triple {38071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38071#false} is VALID [2022-04-08 10:04:39,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {38194#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38071#false} is VALID [2022-04-08 10:04:39,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {38198#(< 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; {38194#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:39,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {38202#(< 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; {38198#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:39,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {38206#(< 0 (mod (+ main_~z~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; {38202#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:39,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {38210#(< 0 (mod (+ 4294967292 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; {38206#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:39,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {38214#(< 0 (mod (+ 4294967291 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; {38210#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:39,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {38218#(< 0 (mod (+ 4294967290 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; {38214#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:39,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {38222#(< 0 (mod (+ main_~z~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; {38218#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:39,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {38226#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {38222#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:04:39,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {38226#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38226#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:04:39,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {38233#(< 0 (mod (+ 4294967290 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; {38226#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:04:39,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {38237#(< 0 (mod (+ 4294967291 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; {38233#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:39,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {38241#(< 0 (mod (+ 4294967292 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; {38237#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:39,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {38245#(< 0 (mod (+ main_~y~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; {38241#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:39,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {38249#(< 0 (mod (+ main_~y~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; {38245#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:39,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {38253#(< 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; {38249#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:39,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {38257#(< 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; {38253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:39,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {38261#(< 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; {38257#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:39,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {38265#(< 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; {38261#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:39,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {38070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38265#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:39,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {38070#true} call #t~ret9 := main(); {38070#true} is VALID [2022-04-08 10:04:39,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38070#true} {38070#true} #50#return; {38070#true} is VALID [2022-04-08 10:04:39,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {38070#true} assume true; {38070#true} is VALID [2022-04-08 10:04:39,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {38070#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); {38070#true} is VALID [2022-04-08 10:04:39,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {38070#true} call ULTIMATE.init(); {38070#true} is VALID [2022-04-08 10:04:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534319183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:39,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:39,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:04:39,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:39,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934738570] [2022-04-08 10:04:39,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934738570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:39,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:39,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:04:39,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826904462] [2022-04-08 10:04:39,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:39,012 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:39,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:39,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:39,027 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:04:39,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:04:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:04:39,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:04:39,043 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:40,663 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-04-08 10:04:40,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:04:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-04-08 10:04:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 55 transitions. [2022-04-08 10:04:40,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 55 transitions. [2022-04-08 10:04:40,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:40,706 INFO L225 Difference]: With dead ends: 70 [2022-04-08 10:04:40,706 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 10:04:40,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=733, Invalid=3427, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 10:04:40,707 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:40,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 10:04:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2022-04-08 10:04:40,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:40,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:40,986 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:40,986 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:40,987 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-08 10:04:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-08 10:04:40,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:40,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:40,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 65 states. [2022-04-08 10:04:40,987 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 65 states. [2022-04-08 10:04:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:40,987 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-08 10:04:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-08 10:04:40,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:40,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:40,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:40,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:04:40,988 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:04:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:40,988 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:04:40,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:40,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:04:41,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:04:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:41,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:41,571 INFO L499 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:41,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:41,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:41,793 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash -726246473, now seen corresponding path program 131 times [2022-04-08 10:04:41,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:41,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992027983] [2022-04-08 10:04:41,796 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:41,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -726246473, now seen corresponding path program 132 times [2022-04-08 10:04:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:41,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339459424] [2022-04-08 10:04:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:42,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:42,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {38723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {38700#true} is VALID [2022-04-08 10:04:42,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-08 10:04:42,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-08 10:04:42,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {38700#true} call ULTIMATE.init(); {38723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:42,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {38723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {38700#true} is VALID [2022-04-08 10:04:42,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-08 10:04:42,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-08 10:04:42,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {38700#true} call #t~ret9 := main(); {38700#true} is VALID [2022-04-08 10:04:42,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {38700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38705#(= main_~y~0 0)} is VALID [2022-04-08 10:04:42,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {38705#(= 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; {38706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:42,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {38706#(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; {38707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:42,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {38707#(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; {38708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:42,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {38708#(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; {38709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:42,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {38709#(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; {38710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:42,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {38710#(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; {38711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:42,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {38711#(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; {38712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:42,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {38712#(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; {38713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:42,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {38713#(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; {38714#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:42,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {38714#(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; {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:42,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:42,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {38716#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:42,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {38716#(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; {38717#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:42,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {38717#(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; {38718#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:42,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {38718#(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; {38719#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:42,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {38719#(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; {38720#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:42,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {38720#(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; {38721#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:42,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {38721#(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; {38722#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:42,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {38722#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {38701#false} is VALID [2022-04-08 10:04:42,069 INFO L272 TraceCheckUtils]: 25: Hoare triple {38701#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38701#false} is VALID [2022-04-08 10:04:42,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {38701#false} ~cond := #in~cond; {38701#false} is VALID [2022-04-08 10:04:42,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {38701#false} assume 0 == ~cond; {38701#false} is VALID [2022-04-08 10:04:42,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {38701#false} assume !false; {38701#false} is VALID [2022-04-08 10:04:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:42,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339459424] [2022-04-08 10:04:42,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339459424] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:42,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797689976] [2022-04-08 10:04:42,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:42,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:42,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:42,070 INFO L229 MonitoredProcess]: Starting monitored process 82 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:04:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-08 10:04:42,149 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:04:42,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:42,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:04:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:42,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:42,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {38700#true} call ULTIMATE.init(); {38700#true} is VALID [2022-04-08 10:04:42,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {38700#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); {38700#true} is VALID [2022-04-08 10:04:42,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-08 10:04:42,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-08 10:04:42,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {38700#true} call #t~ret9 := main(); {38700#true} is VALID [2022-04-08 10:04:42,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {38700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38705#(= main_~y~0 0)} is VALID [2022-04-08 10:04:42,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {38705#(= 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; {38706#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:42,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {38706#(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; {38707#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:42,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {38707#(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; {38708#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:42,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {38708#(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; {38709#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:42,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {38709#(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; {38710#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:42,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {38710#(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; {38711#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:42,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {38711#(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; {38712#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:42,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {38712#(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; {38713#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:42,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {38713#(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; {38714#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:42,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {38714#(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; {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:42,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:42,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {38715#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {38716#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:42,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {38716#(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; {38717#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:42,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {38717#(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; {38718#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:42,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {38718#(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; {38719#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:42,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {38719#(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; {38720#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:42,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {38720#(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; {38721#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:42,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {38721#(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; {38796#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:42,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {38796#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {38701#false} is VALID [2022-04-08 10:04:42,442 INFO L272 TraceCheckUtils]: 25: Hoare triple {38701#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38701#false} is VALID [2022-04-08 10:04:42,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {38701#false} ~cond := #in~cond; {38701#false} is VALID [2022-04-08 10:04:42,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {38701#false} assume 0 == ~cond; {38701#false} is VALID [2022-04-08 10:04:42,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {38701#false} assume !false; {38701#false} is VALID [2022-04-08 10:04:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:42,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:42,844 INFO L290 TraceCheckUtils]: 28: Hoare triple {38701#false} assume !false; {38701#false} is VALID [2022-04-08 10:04:42,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {38701#false} assume 0 == ~cond; {38701#false} is VALID [2022-04-08 10:04:42,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {38701#false} ~cond := #in~cond; {38701#false} is VALID [2022-04-08 10:04:42,844 INFO L272 TraceCheckUtils]: 25: Hoare triple {38701#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38701#false} is VALID [2022-04-08 10:04:42,845 INFO L290 TraceCheckUtils]: 24: Hoare triple {38824#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38701#false} is VALID [2022-04-08 10:04:42,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {38828#(< 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; {38824#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:42,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {38832#(< 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; {38828#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:42,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {38836#(< 0 (mod (+ main_~z~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; {38832#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:42,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {38840#(< 0 (mod (+ 4294967292 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; {38836#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:42,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {38844#(< 0 (mod (+ 4294967291 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; {38840#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:42,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {38848#(< 0 (mod (+ 4294967290 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; {38844#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:42,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {38852#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {38848#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:42,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {38852#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {38852#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:42,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {38859#(< 0 (mod (+ 4294967291 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; {38852#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:42,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {38863#(< 0 (mod (+ 4294967292 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; {38859#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:42,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {38867#(< 0 (mod (+ main_~y~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; {38863#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:42,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {38871#(< 0 (mod (+ main_~y~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; {38867#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:42,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {38875#(< 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; {38871#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:42,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {38879#(< 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; {38875#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:42,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {38883#(< 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; {38879#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:42,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {38887#(< 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; {38883#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:42,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {38891#(< 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; {38887#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:42,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {38895#(< 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; {38891#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:42,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {38700#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38895#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:42,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {38700#true} call #t~ret9 := main(); {38700#true} is VALID [2022-04-08 10:04:42,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38700#true} {38700#true} #50#return; {38700#true} is VALID [2022-04-08 10:04:42,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {38700#true} assume true; {38700#true} is VALID [2022-04-08 10:04:42,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {38700#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); {38700#true} is VALID [2022-04-08 10:04:42,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {38700#true} call ULTIMATE.init(); {38700#true} is VALID [2022-04-08 10:04:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:42,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797689976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:42,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:42,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:04:42,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:42,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992027983] [2022-04-08 10:04:42,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992027983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:42,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:42,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:04:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214184940] [2022-04-08 10:04:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:42,855 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:42,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:42,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:42,868 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:04:42,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:04:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:04:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:04:42,868 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:45,046 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-04-08 10:04:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:04:45,047 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2022-04-08 10:04:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2022-04-08 10:04:45,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 64 transitions. [2022-04-08 10:04:45,095 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:04:45,096 INFO L225 Difference]: With dead ends: 78 [2022-04-08 10:04:45,096 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 10:04:45,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=853, Invalid=3839, Unknown=0, NotChecked=0, Total=4692 [2022-04-08 10:04:45,096 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:45,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 87 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 10:04:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2022-04-08 10:04:45,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:45,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:45,488 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:45,488 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:45,489 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-08 10:04:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-08 10:04:45,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:45,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:45,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 73 states. [2022-04-08 10:04:45,489 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 73 states. [2022-04-08 10:04:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:45,490 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-08 10:04:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-08 10:04:45,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:45,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:45,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:45,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:04:45,491 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:04:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:45,491 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:04:45,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:45,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:04:46,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:04:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:46,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:46,063 INFO L499 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:46,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:46,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:46,279 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1200111542, now seen corresponding path program 133 times [2022-04-08 10:04:46,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:46,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1472068847] [2022-04-08 10:04:46,281 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:46,281 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1200111542, now seen corresponding path program 134 times [2022-04-08 10:04:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:46,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181601905] [2022-04-08 10:04:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:46,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:46,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {39393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {39370#true} is VALID [2022-04-08 10:04:46,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-08 10:04:46,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-08 10:04:46,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {39370#true} call ULTIMATE.init(); {39393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:46,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {39393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {39370#true} is VALID [2022-04-08 10:04:46,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-08 10:04:46,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-08 10:04:46,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {39370#true} call #t~ret9 := main(); {39370#true} is VALID [2022-04-08 10:04:46,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {39370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39375#(= main_~y~0 0)} is VALID [2022-04-08 10:04:46,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {39375#(= 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; {39376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:46,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {39376#(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; {39377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:46,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {39377#(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; {39378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:46,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {39378#(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; {39379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:46,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {39379#(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; {39380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:46,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {39380#(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; {39381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:46,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {39381#(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; {39382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:46,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {39382#(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; {39383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:46,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {39383#(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; {39384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:46,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {39384#(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; {39385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:46,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {39385#(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; {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:46,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:46,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {39387#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:46,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {39387#(and (<= main_~z~0 11) (<= 11 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; {39388#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:46,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {39388#(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; {39389#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:46,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {39389#(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; {39390#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:46,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {39390#(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; {39391#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:46,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {39391#(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; {39392#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:46,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {39392#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {39371#false} is VALID [2022-04-08 10:04:46,566 INFO L272 TraceCheckUtils]: 25: Hoare triple {39371#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39371#false} is VALID [2022-04-08 10:04:46,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {39371#false} ~cond := #in~cond; {39371#false} is VALID [2022-04-08 10:04:46,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {39371#false} assume 0 == ~cond; {39371#false} is VALID [2022-04-08 10:04:46,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {39371#false} assume !false; {39371#false} is VALID [2022-04-08 10:04:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:46,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:46,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181601905] [2022-04-08 10:04:46,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181601905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:46,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329005613] [2022-04-08 10:04:46,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:46,568 INFO L229 MonitoredProcess]: Starting monitored process 83 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:04:46,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-04-08 10:04:46,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:46,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:46,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:04:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:46,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:46,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {39370#true} call ULTIMATE.init(); {39370#true} is VALID [2022-04-08 10:04:46,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {39370#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); {39370#true} is VALID [2022-04-08 10:04:46,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-08 10:04:46,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-08 10:04:46,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {39370#true} call #t~ret9 := main(); {39370#true} is VALID [2022-04-08 10:04:46,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {39370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39375#(= main_~y~0 0)} is VALID [2022-04-08 10:04:46,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {39375#(= 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; {39376#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:46,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {39376#(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; {39377#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:46,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {39377#(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; {39378#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:46,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {39378#(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; {39379#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:46,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {39379#(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; {39380#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:46,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {39380#(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; {39381#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:46,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {39381#(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; {39382#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:46,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {39382#(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; {39383#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:46,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {39383#(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; {39384#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:46,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {39384#(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; {39385#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:46,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {39385#(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; {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:46,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:46,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {39386#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {39387#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:46,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {39387#(and (<= main_~z~0 11) (<= 11 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; {39388#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:46,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {39388#(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; {39389#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:46,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {39389#(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; {39390#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:46,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {39390#(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; {39391#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:04:46,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {39391#(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; {39466#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:46,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {39466#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {39371#false} is VALID [2022-04-08 10:04:46,851 INFO L272 TraceCheckUtils]: 25: Hoare triple {39371#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39371#false} is VALID [2022-04-08 10:04:46,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {39371#false} ~cond := #in~cond; {39371#false} is VALID [2022-04-08 10:04:46,851 INFO L290 TraceCheckUtils]: 27: Hoare triple {39371#false} assume 0 == ~cond; {39371#false} is VALID [2022-04-08 10:04:46,851 INFO L290 TraceCheckUtils]: 28: Hoare triple {39371#false} assume !false; {39371#false} is VALID [2022-04-08 10:04:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:46,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:47,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {39371#false} assume !false; {39371#false} is VALID [2022-04-08 10:04:47,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {39371#false} assume 0 == ~cond; {39371#false} is VALID [2022-04-08 10:04:47,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {39371#false} ~cond := #in~cond; {39371#false} is VALID [2022-04-08 10:04:47,387 INFO L272 TraceCheckUtils]: 25: Hoare triple {39371#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39371#false} is VALID [2022-04-08 10:04:47,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {39494#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {39371#false} is VALID [2022-04-08 10:04:47,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {39498#(< 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; {39494#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:47,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {39502#(< 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; {39498#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:47,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {39506#(< 0 (mod (+ main_~z~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; {39502#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:47,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {39510#(< 0 (mod (+ 4294967292 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; {39506#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:47,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {39514#(< 0 (mod (+ 4294967291 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; {39510#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:47,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {39518#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {39514#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:47,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {39518#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {39518#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:47,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {39525#(< 0 (mod (+ 4294967292 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; {39518#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:47,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {39529#(< 0 (mod (+ main_~y~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; {39525#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:47,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {39533#(< 0 (mod (+ main_~y~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; {39529#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:47,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {39537#(< 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; {39533#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:47,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {39541#(< 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; {39537#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:47,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {39545#(< 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; {39541#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:47,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {39549#(< 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; {39545#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:47,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {39553#(< 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; {39549#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:47,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {39557#(< 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; {39553#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:47,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {39561#(< 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; {39557#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:47,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {39565#(< 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; {39561#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:47,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {39370#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39565#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:47,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {39370#true} call #t~ret9 := main(); {39370#true} is VALID [2022-04-08 10:04:47,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39370#true} {39370#true} #50#return; {39370#true} is VALID [2022-04-08 10:04:47,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {39370#true} assume true; {39370#true} is VALID [2022-04-08 10:04:47,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {39370#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); {39370#true} is VALID [2022-04-08 10:04:47,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {39370#true} call ULTIMATE.init(); {39370#true} is VALID [2022-04-08 10:04:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:47,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329005613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:47,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:47,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:04:47,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:47,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1472068847] [2022-04-08 10:04:47,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1472068847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:47,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:47,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:04:47,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736223544] [2022-04-08 10:04:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:47,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:47,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:47,411 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:04:47,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:04:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:04:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:04:47,412 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:49,676 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-04-08 10:04:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:04:49,676 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2022-04-08 10:04:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2022-04-08 10:04:49,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 70 transitions. [2022-04-08 10:04:49,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:49,713 INFO L225 Difference]: With dead ends: 85 [2022-04-08 10:04:49,713 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 10:04:49,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=909, Invalid=3921, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:04:49,714 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:49,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 100 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 10:04:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 47. [2022-04-08 10:04:50,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:50,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:50,026 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:50,026 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:50,027 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-08 10:04:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-08 10:04:50,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:50,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:50,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 80 states. [2022-04-08 10:04:50,027 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 80 states. [2022-04-08 10:04:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:50,028 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-08 10:04:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-08 10:04:50,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:50,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:50,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:50,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:04:50,029 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:04:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:50,029 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:04:50,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:50,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:04:50,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:04:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:50,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:50,658 INFO L499 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:50,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:50,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable83 [2022-04-08 10:04:50,875 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1123704791, now seen corresponding path program 135 times [2022-04-08 10:04:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:50,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433592970] [2022-04-08 10:04:50,877 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:50,877 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1123704791, now seen corresponding path program 136 times [2022-04-08 10:04:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:50,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679011833] [2022-04-08 10:04:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:51,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {40093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {40070#true} is VALID [2022-04-08 10:04:51,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-08 10:04:51,148 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-08 10:04:51,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {40070#true} call ULTIMATE.init(); {40093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:51,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {40093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {40070#true} is VALID [2022-04-08 10:04:51,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-08 10:04:51,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-08 10:04:51,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {40070#true} call #t~ret9 := main(); {40070#true} is VALID [2022-04-08 10:04:51,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {40070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40075#(= main_~y~0 0)} is VALID [2022-04-08 10:04:51,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {40075#(= 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; {40076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:51,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {40076#(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; {40077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:51,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {40077#(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; {40078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:51,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {40078#(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; {40079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:51,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {40079#(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; {40080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:51,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {40080#(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; {40081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:51,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {40081#(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; {40082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:51,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {40082#(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; {40083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:51,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {40083#(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; {40084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:51,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {40084#(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; {40085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:51,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {40085#(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; {40086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:51,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {40086#(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; {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:51,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:51,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {40088#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:51,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {40088#(and (<= main_~z~0 12) (<= 12 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; {40089#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:51,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {40089#(and (<= main_~z~0 11) (<= 11 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; {40090#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:51,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {40090#(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; {40091#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:51,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {40091#(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; {40092#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:51,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {40092#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {40071#false} is VALID [2022-04-08 10:04:51,159 INFO L272 TraceCheckUtils]: 25: Hoare triple {40071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40071#false} is VALID [2022-04-08 10:04:51,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {40071#false} ~cond := #in~cond; {40071#false} is VALID [2022-04-08 10:04:51,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {40071#false} assume 0 == ~cond; {40071#false} is VALID [2022-04-08 10:04:51,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {40071#false} assume !false; {40071#false} is VALID [2022-04-08 10:04:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:51,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679011833] [2022-04-08 10:04:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679011833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170453077] [2022-04-08 10:04:51,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:51,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:51,169 INFO L229 MonitoredProcess]: Starting monitored process 84 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:04:51,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-04-08 10:04:51,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:51,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:51,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:04:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:51,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:51,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {40070#true} call ULTIMATE.init(); {40070#true} is VALID [2022-04-08 10:04:51,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {40070#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); {40070#true} is VALID [2022-04-08 10:04:51,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-08 10:04:51,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-08 10:04:51,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {40070#true} call #t~ret9 := main(); {40070#true} is VALID [2022-04-08 10:04:51,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {40070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40075#(= main_~y~0 0)} is VALID [2022-04-08 10:04:51,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {40075#(= 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; {40076#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:51,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {40076#(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; {40077#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:51,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {40077#(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; {40078#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:51,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {40078#(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; {40079#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:51,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {40079#(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; {40080#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:51,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {40080#(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; {40081#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:51,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {40081#(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; {40082#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:51,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {40082#(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; {40083#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:51,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {40083#(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; {40084#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:51,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {40084#(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; {40085#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:51,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {40085#(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; {40086#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:51,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {40086#(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; {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:51,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:51,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {40087#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {40088#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:51,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {40088#(and (<= main_~z~0 12) (<= 12 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; {40089#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:51,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {40089#(and (<= main_~z~0 11) (<= 11 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; {40090#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:51,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {40090#(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; {40091#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:04:51,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {40091#(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; {40166#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:04:51,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {40166#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {40071#false} is VALID [2022-04-08 10:04:51,453 INFO L272 TraceCheckUtils]: 25: Hoare triple {40071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40071#false} is VALID [2022-04-08 10:04:51,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {40071#false} ~cond := #in~cond; {40071#false} is VALID [2022-04-08 10:04:51,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {40071#false} assume 0 == ~cond; {40071#false} is VALID [2022-04-08 10:04:51,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {40071#false} assume !false; {40071#false} is VALID [2022-04-08 10:04:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:51,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:51,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {40071#false} assume !false; {40071#false} is VALID [2022-04-08 10:04:51,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {40071#false} assume 0 == ~cond; {40071#false} is VALID [2022-04-08 10:04:51,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {40071#false} ~cond := #in~cond; {40071#false} is VALID [2022-04-08 10:04:51,827 INFO L272 TraceCheckUtils]: 25: Hoare triple {40071#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40071#false} is VALID [2022-04-08 10:04:51,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {40194#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40071#false} is VALID [2022-04-08 10:04:51,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {40198#(< 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; {40194#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:51,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {40202#(< 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; {40198#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:51,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {40206#(< 0 (mod (+ main_~z~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; {40202#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:51,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {40210#(< 0 (mod (+ 4294967292 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; {40206#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:51,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {40214#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {40210#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:04:51,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {40214#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40214#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:51,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {40221#(< 0 (mod (+ main_~y~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; {40214#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:51,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {40225#(< 0 (mod (+ main_~y~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; {40221#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:51,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {40229#(< 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; {40225#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:51,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {40233#(< 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; {40229#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:51,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {40237#(< 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; {40233#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:51,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {40241#(< 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; {40237#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:51,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {40245#(< 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; {40241#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:51,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {40249#(< 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; {40245#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:51,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {40253#(< 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; {40249#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:51,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {40257#(< 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; {40253#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:51,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {40261#(< 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; {40257#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:51,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {40265#(< 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; {40261#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:51,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {40070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40265#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:51,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {40070#true} call #t~ret9 := main(); {40070#true} is VALID [2022-04-08 10:04:51,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40070#true} {40070#true} #50#return; {40070#true} is VALID [2022-04-08 10:04:51,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {40070#true} assume true; {40070#true} is VALID [2022-04-08 10:04:51,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {40070#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); {40070#true} is VALID [2022-04-08 10:04:51,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {40070#true} call ULTIMATE.init(); {40070#true} is VALID [2022-04-08 10:04:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:51,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170453077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:51,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:51,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:04:51,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:51,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433592970] [2022-04-08 10:04:51,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433592970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:51,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:51,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:04:51,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882118863] [2022-04-08 10:04:51,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:51,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:51,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:51,849 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:04:51,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:04:51,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:04:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:04:51,850 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:54,138 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2022-04-08 10:04:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:04:54,138 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-08 10:04:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-08 10:04:54,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 73 transitions. [2022-04-08 10:04:54,195 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:04:54,196 INFO L225 Difference]: With dead ends: 91 [2022-04-08 10:04:54,196 INFO L226 Difference]: Without dead ends: 86 [2022-04-08 10:04:54,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=872, Invalid=3684, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:04:54,197 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:54,197 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 103 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-08 10:04:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 47. [2022-04-08 10:04:54,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:54,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:54,507 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:54,507 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:54,508 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-04-08 10:04:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-04-08 10:04:54,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:54,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:54,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 86 states. [2022-04-08 10:04:54,509 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 86 states. [2022-04-08 10:04:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:54,509 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2022-04-08 10:04:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2022-04-08 10:04:54,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:54,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:54,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:54,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:04:54,510 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:04:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:54,510 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:04:54,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:54,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:04:55,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:04:55,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:55,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:55,304 INFO L499 BasicCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:55,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:55,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:55,509 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:55,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2091071382, now seen corresponding path program 137 times [2022-04-08 10:04:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:55,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [348020506] [2022-04-08 10:04:55,512 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:55,512 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2091071382, now seen corresponding path program 138 times [2022-04-08 10:04:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926213402] [2022-04-08 10:04:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:55,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {40813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {40790#true} is VALID [2022-04-08 10:04:55,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-08 10:04:55,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-08 10:04:55,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {40790#true} call ULTIMATE.init(); {40813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:55,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {40813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {40790#true} is VALID [2022-04-08 10:04:55,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-08 10:04:55,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-08 10:04:55,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {40790#true} call #t~ret9 := main(); {40790#true} is VALID [2022-04-08 10:04:55,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {40790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40795#(= main_~y~0 0)} is VALID [2022-04-08 10:04:55,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {40795#(= 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; {40796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:55,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {40796#(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; {40797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:55,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {40797#(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; {40798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:55,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {40798#(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; {40799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:55,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {40799#(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; {40800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:55,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {40800#(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; {40801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:55,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {40801#(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; {40802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:55,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {40802#(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; {40803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:55,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {40803#(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; {40804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:55,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {40804#(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; {40805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:55,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {40805#(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; {40806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:55,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {40806#(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; {40807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:55,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {40807#(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; {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:55,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:55,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {40809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:04:55,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {40809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40810#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:55,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {40810#(and (<= main_~z~0 12) (<= 12 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; {40811#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:55,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {40811#(and (<= main_~z~0 11) (<= 11 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; {40812#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:55,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {40812#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {40791#false} is VALID [2022-04-08 10:04:55,797 INFO L272 TraceCheckUtils]: 25: Hoare triple {40791#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40791#false} is VALID [2022-04-08 10:04:55,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {40791#false} ~cond := #in~cond; {40791#false} is VALID [2022-04-08 10:04:55,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {40791#false} assume 0 == ~cond; {40791#false} is VALID [2022-04-08 10:04:55,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {40791#false} assume !false; {40791#false} is VALID [2022-04-08 10:04:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:55,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926213402] [2022-04-08 10:04:55,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926213402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:55,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632385053] [2022-04-08 10:04:55,798 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:55,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:55,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:55,800 INFO L229 MonitoredProcess]: Starting monitored process 85 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:04:55,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-08 10:04:55,951 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:04:55,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:55,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:04:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:55,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:56,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {40790#true} call ULTIMATE.init(); {40790#true} is VALID [2022-04-08 10:04:56,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {40790#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); {40790#true} is VALID [2022-04-08 10:04:56,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-08 10:04:56,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-08 10:04:56,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {40790#true} call #t~ret9 := main(); {40790#true} is VALID [2022-04-08 10:04:56,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {40790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40795#(= main_~y~0 0)} is VALID [2022-04-08 10:04:56,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {40795#(= 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; {40796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:56,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {40796#(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; {40797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:56,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {40797#(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; {40798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:56,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {40798#(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; {40799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:56,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {40799#(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; {40800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:56,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {40800#(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; {40801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:56,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {40801#(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; {40802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:56,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {40802#(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; {40803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:56,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {40803#(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; {40804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:56,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {40804#(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; {40805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:56,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {40805#(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; {40806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:56,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {40806#(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; {40807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:56,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {40807#(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; {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:56,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:56,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {40808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {40809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:04:56,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {40809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40810#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:56,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {40810#(and (<= main_~z~0 12) (<= 12 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; {40811#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:04:56,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {40811#(and (<= main_~z~0 11) (<= 11 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; {40886#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:04:56,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {40886#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40791#false} is VALID [2022-04-08 10:04:56,155 INFO L272 TraceCheckUtils]: 25: Hoare triple {40791#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40791#false} is VALID [2022-04-08 10:04:56,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {40791#false} ~cond := #in~cond; {40791#false} is VALID [2022-04-08 10:04:56,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {40791#false} assume 0 == ~cond; {40791#false} is VALID [2022-04-08 10:04:56,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {40791#false} assume !false; {40791#false} is VALID [2022-04-08 10:04:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:56,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:56,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {40791#false} assume !false; {40791#false} is VALID [2022-04-08 10:04:56,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {40791#false} assume 0 == ~cond; {40791#false} is VALID [2022-04-08 10:04:56,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {40791#false} ~cond := #in~cond; {40791#false} is VALID [2022-04-08 10:04:56,540 INFO L272 TraceCheckUtils]: 25: Hoare triple {40791#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40791#false} is VALID [2022-04-08 10:04:56,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {40914#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40791#false} is VALID [2022-04-08 10:04:56,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {40918#(< 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; {40914#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:56,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {40922#(< 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; {40918#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:56,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {40926#(< 0 (mod (+ main_~z~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; {40922#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:56,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {40930#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {40926#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:56,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {40930#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40930#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:56,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {40937#(< 0 (mod (+ main_~y~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; {40930#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:56,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {40941#(< 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; {40937#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:56,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {40945#(< 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; {40941#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:56,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {40949#(< 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; {40945#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:56,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {40953#(< 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; {40949#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:56,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {40957#(< 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; {40953#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:56,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {40961#(< 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; {40957#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:56,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {40965#(< 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; {40961#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:56,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {40969#(< 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; {40965#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:56,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {40973#(< 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; {40969#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:56,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {40977#(< 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; {40973#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:56,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {40981#(< 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; {40977#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:56,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {40985#(< 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; {40981#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:56,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {40790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40985#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:56,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {40790#true} call #t~ret9 := main(); {40790#true} is VALID [2022-04-08 10:04:56,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40790#true} {40790#true} #50#return; {40790#true} is VALID [2022-04-08 10:04:56,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {40790#true} assume true; {40790#true} is VALID [2022-04-08 10:04:56,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {40790#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); {40790#true} is VALID [2022-04-08 10:04:56,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {40790#true} call ULTIMATE.init(); {40790#true} is VALID [2022-04-08 10:04:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:56,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632385053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:56,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:56,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:04:56,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:56,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [348020506] [2022-04-08 10:04:56,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [348020506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:56,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:56,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:04:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158401332] [2022-04-08 10:04:56,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:56,550 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:56,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:56,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:56,563 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:04:56,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:04:56,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:04:56,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:04:56,565 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:59,035 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-08 10:04:59,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:04:59,036 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-08 10:04:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 74 transitions. [2022-04-08 10:04:59,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 74 transitions. [2022-04-08 10:04:59,080 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:04:59,084 INFO L225 Difference]: With dead ends: 96 [2022-04-08 10:04:59,084 INFO L226 Difference]: Without dead ends: 91 [2022-04-08 10:04:59,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:04:59,087 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:59,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 118 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:04:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-08 10:04:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 47. [2022-04-08 10:04:59,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:59,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:59,385 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:59,385 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:59,386 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-04-08 10:04:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-04-08 10:04:59,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:59,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:59,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 91 states. [2022-04-08 10:04:59,387 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 91 states. [2022-04-08 10:04:59,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:59,387 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-04-08 10:04:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-04-08 10:04:59,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:59,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:59,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:59,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:04:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:04:59,388 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:04:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:59,389 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:04:59,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:04:59,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:04:59,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:04:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:59,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:59,963 INFO L499 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:59,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:00,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:00,167 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1152445431, now seen corresponding path program 139 times [2022-04-08 10:05:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:00,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897197847] [2022-04-08 10:05:00,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:00,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1152445431, now seen corresponding path program 140 times [2022-04-08 10:05:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:00,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464093711] [2022-04-08 10:05:00,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:00,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {41545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {41522#true} is VALID [2022-04-08 10:05:00,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-08 10:05:00,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-08 10:05:00,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {41522#true} call ULTIMATE.init(); {41545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:00,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {41545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {41522#true} is VALID [2022-04-08 10:05:00,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-08 10:05:00,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-08 10:05:00,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {41522#true} call #t~ret9 := main(); {41522#true} is VALID [2022-04-08 10:05:00,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {41522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41527#(= main_~y~0 0)} is VALID [2022-04-08 10:05:00,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {41527#(= 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; {41528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:00,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {41528#(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; {41529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:00,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {41529#(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; {41530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:00,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {41530#(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; {41531#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:00,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {41531#(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; {41532#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:00,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {41532#(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; {41533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:00,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {41533#(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; {41534#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:00,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {41534#(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; {41535#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:00,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {41535#(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; {41536#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:00,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {41536#(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; {41537#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:00,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {41537#(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; {41538#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:00,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {41538#(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; {41539#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:00,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {41539#(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; {41540#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:00,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {41540#(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; {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:00,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:00,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {41542#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:05:00,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {41542#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41543#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:05:00,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {41543#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41544#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:00,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {41544#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41523#false} is VALID [2022-04-08 10:05:00,492 INFO L272 TraceCheckUtils]: 25: Hoare triple {41523#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41523#false} is VALID [2022-04-08 10:05:00,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {41523#false} ~cond := #in~cond; {41523#false} is VALID [2022-04-08 10:05:00,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {41523#false} assume 0 == ~cond; {41523#false} is VALID [2022-04-08 10:05:00,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {41523#false} assume !false; {41523#false} is VALID [2022-04-08 10:05:00,492 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:05:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:00,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464093711] [2022-04-08 10:05:00,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464093711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:00,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910239015] [2022-04-08 10:05:00,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:00,495 INFO L229 MonitoredProcess]: Starting monitored process 86 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:05:00,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-04-08 10:05:00,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:00,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:00,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:05:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:00,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:00,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {41522#true} call ULTIMATE.init(); {41522#true} is VALID [2022-04-08 10:05:00,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {41522#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); {41522#true} is VALID [2022-04-08 10:05:00,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-08 10:05:00,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-08 10:05:00,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {41522#true} call #t~ret9 := main(); {41522#true} is VALID [2022-04-08 10:05:00,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {41522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41527#(= main_~y~0 0)} is VALID [2022-04-08 10:05:00,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {41527#(= 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; {41528#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:00,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {41528#(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; {41529#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:00,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {41529#(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; {41530#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:00,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {41530#(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; {41531#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:00,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {41531#(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; {41532#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:00,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {41532#(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; {41533#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:00,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {41533#(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; {41534#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:00,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {41534#(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; {41535#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:00,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {41535#(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; {41536#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:00,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {41536#(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; {41537#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:00,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {41537#(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; {41538#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:00,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {41538#(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; {41539#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:00,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {41539#(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; {41540#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:00,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {41540#(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; {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:00,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:00,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {41541#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {41542#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:05:00,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {41542#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41543#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:05:00,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {41543#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41618#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:00,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {41618#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41523#false} is VALID [2022-04-08 10:05:00,854 INFO L272 TraceCheckUtils]: 25: Hoare triple {41523#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41523#false} is VALID [2022-04-08 10:05:00,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {41523#false} ~cond := #in~cond; {41523#false} is VALID [2022-04-08 10:05:00,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {41523#false} assume 0 == ~cond; {41523#false} is VALID [2022-04-08 10:05:00,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {41523#false} assume !false; {41523#false} is VALID [2022-04-08 10:05:00,855 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:05:00,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:01,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {41523#false} assume !false; {41523#false} is VALID [2022-04-08 10:05:01,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {41523#false} assume 0 == ~cond; {41523#false} is VALID [2022-04-08 10:05:01,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {41523#false} ~cond := #in~cond; {41523#false} is VALID [2022-04-08 10:05:01,412 INFO L272 TraceCheckUtils]: 25: Hoare triple {41523#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41523#false} is VALID [2022-04-08 10:05:01,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {41646#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {41523#false} is VALID [2022-04-08 10:05:01,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {41650#(< 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; {41646#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:01,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {41654#(< 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; {41650#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:01,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {41658#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {41654#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:01,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {41658#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {41658#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:01,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {41665#(< 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; {41658#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:01,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {41669#(< 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; {41665#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:01,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {41673#(< 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; {41669#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {41677#(< 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; {41673#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:01,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {41681#(< 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; {41677#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:01,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {41685#(< 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; {41681#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:01,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {41689#(< 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; {41685#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:01,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {41693#(< 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; {41689#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:01,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {41697#(< 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; {41693#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:01,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {41701#(< 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; {41697#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:01,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {41705#(< 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; {41701#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:01,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {41709#(< 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; {41705#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:01,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {41713#(< 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; {41709#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:01,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {41717#(< 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; {41713#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:01,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {41522#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41717#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:01,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {41522#true} call #t~ret9 := main(); {41522#true} is VALID [2022-04-08 10:05:01,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41522#true} {41522#true} #50#return; {41522#true} is VALID [2022-04-08 10:05:01,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {41522#true} assume true; {41522#true} is VALID [2022-04-08 10:05:01,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {41522#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); {41522#true} is VALID [2022-04-08 10:05:01,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {41522#true} call ULTIMATE.init(); {41522#true} is VALID [2022-04-08 10:05:01,422 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:05:01,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910239015] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:01,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:01,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:05:01,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:01,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897197847] [2022-04-08 10:05:01,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897197847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:01,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:01,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:05:01,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839431852] [2022-04-08 10:05:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:01,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:01,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:01,436 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:05:01,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:05:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:01,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:05:01,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:05:01,437 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:04,548 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-04-08 10:05:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:05:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-08 10:05:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-08 10:05:04,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 76 transitions. [2022-04-08 10:05:04,611 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:05:04,612 INFO L225 Difference]: With dead ends: 100 [2022-04-08 10:05:04,612 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 10:05:04,612 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=746, Invalid=2914, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:05:04,613 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:04,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 128 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:05:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 10:05:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 47. [2022-04-08 10:05:05,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:05,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,037 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,037 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:05,038 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-08 10:05:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-08 10:05:05,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:05,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:05,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 95 states. [2022-04-08 10:05:05,038 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 95 states. [2022-04-08 10:05:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:05,039 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-08 10:05:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-08 10:05:05,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:05,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:05,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:05,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:05:05,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:05:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:05,039 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:05:05,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:05,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:05:05,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:05:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:05:05,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:05,692 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:05,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:05,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:05,908 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 567977846, now seen corresponding path program 141 times [2022-04-08 10:05:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866345976] [2022-04-08 10:05:05,910 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:05,910 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 567977846, now seen corresponding path program 142 times [2022-04-08 10:05:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:05,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423338333] [2022-04-08 10:05:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:06,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:06,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {42287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {42264#true} is VALID [2022-04-08 10:05:06,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-08 10:05:06,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-08 10:05:06,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {42264#true} call ULTIMATE.init(); {42287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:06,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {42287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {42264#true} is VALID [2022-04-08 10:05:06,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-08 10:05:06,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-08 10:05:06,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {42264#true} call #t~ret9 := main(); {42264#true} is VALID [2022-04-08 10:05:06,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {42264#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42269#(= main_~y~0 0)} is VALID [2022-04-08 10:05:06,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {42269#(= 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; {42270#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:06,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {42270#(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; {42271#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:06,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {42271#(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; {42272#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:06,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {42272#(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; {42273#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:06,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {42273#(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; {42274#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:06,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {42274#(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; {42275#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:06,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {42275#(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; {42276#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:06,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {42276#(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; {42277#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:06,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {42277#(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; {42278#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:06,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {42278#(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; {42279#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:06,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {42279#(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; {42280#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:06,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {42280#(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; {42281#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:06,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {42281#(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; {42282#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:06,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {42282#(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; {42283#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:06,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {42283#(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; {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:06,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:06,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {42285#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:05:06,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {42285#(and (<= main_~z~0 15) (<= 15 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; {42286#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:06,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {42286#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {42265#false} is VALID [2022-04-08 10:05:06,163 INFO L272 TraceCheckUtils]: 25: Hoare triple {42265#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42265#false} is VALID [2022-04-08 10:05:06,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {42265#false} ~cond := #in~cond; {42265#false} is VALID [2022-04-08 10:05:06,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {42265#false} assume 0 == ~cond; {42265#false} is VALID [2022-04-08 10:05:06,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {42265#false} assume !false; {42265#false} is VALID [2022-04-08 10:05:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:06,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423338333] [2022-04-08 10:05:06,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423338333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:06,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167672041] [2022-04-08 10:05:06,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:06,165 INFO L229 MonitoredProcess]: Starting monitored process 87 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:05:06,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-04-08 10:05:06,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:06,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:06,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:05:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:06,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:06,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {42264#true} call ULTIMATE.init(); {42264#true} is VALID [2022-04-08 10:05:06,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {42264#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); {42264#true} is VALID [2022-04-08 10:05:06,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-08 10:05:06,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-08 10:05:06,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {42264#true} call #t~ret9 := main(); {42264#true} is VALID [2022-04-08 10:05:06,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {42264#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42269#(= main_~y~0 0)} is VALID [2022-04-08 10:05:06,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {42269#(= 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; {42270#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:06,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {42270#(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; {42271#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:06,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {42271#(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; {42272#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:06,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {42272#(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; {42273#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:06,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {42273#(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; {42274#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:06,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {42274#(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; {42275#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:06,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {42275#(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; {42276#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:06,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {42276#(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; {42277#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:06,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {42277#(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; {42278#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:06,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {42278#(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; {42279#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:06,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {42279#(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; {42280#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:06,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {42280#(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; {42281#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:06,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {42281#(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; {42282#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:06,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {42282#(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; {42283#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:06,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {42283#(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; {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:06,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:06,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {42284#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {42285#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:05:06,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {42285#(and (<= main_~z~0 15) (<= 15 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; {42360#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:05:06,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {42360#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {42265#false} is VALID [2022-04-08 10:05:06,518 INFO L272 TraceCheckUtils]: 25: Hoare triple {42265#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42265#false} is VALID [2022-04-08 10:05:06,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {42265#false} ~cond := #in~cond; {42265#false} is VALID [2022-04-08 10:05:06,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {42265#false} assume 0 == ~cond; {42265#false} is VALID [2022-04-08 10:05:06,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {42265#false} assume !false; {42265#false} is VALID [2022-04-08 10:05:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:06,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:07,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {42265#false} assume !false; {42265#false} is VALID [2022-04-08 10:05:07,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {42265#false} assume 0 == ~cond; {42265#false} is VALID [2022-04-08 10:05:07,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {42265#false} ~cond := #in~cond; {42265#false} is VALID [2022-04-08 10:05:07,131 INFO L272 TraceCheckUtils]: 25: Hoare triple {42265#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42265#false} is VALID [2022-04-08 10:05:07,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {42388#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42265#false} is VALID [2022-04-08 10:05:07,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {42392#(< 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; {42388#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:07,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {42396#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {42392#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:07,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {42396#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {42396#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:07,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {42403#(< 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; {42396#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:07,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {42407#(< 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; {42403#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:07,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {42411#(< 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; {42407#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:07,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {42415#(< 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; {42411#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:07,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {42419#(< 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; {42415#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:07,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {42423#(< 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; {42419#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:07,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {42427#(< 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; {42423#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:07,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {42431#(< 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; {42427#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:07,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {42435#(< 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; {42431#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:07,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {42439#(< 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; {42435#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:07,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {42443#(< 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; {42439#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:07,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {42447#(< 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; {42443#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:07,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {42451#(< 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; {42447#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:07,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {42455#(< 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; {42451#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:07,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {42459#(< 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; {42455#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:07,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {42264#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42459#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:05:07,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {42264#true} call #t~ret9 := main(); {42264#true} is VALID [2022-04-08 10:05:07,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42264#true} {42264#true} #50#return; {42264#true} is VALID [2022-04-08 10:05:07,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {42264#true} assume true; {42264#true} is VALID [2022-04-08 10:05:07,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {42264#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); {42264#true} is VALID [2022-04-08 10:05:07,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {42264#true} call ULTIMATE.init(); {42264#true} is VALID [2022-04-08 10:05:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:07,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167672041] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:07,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:07,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:05:07,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:07,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866345976] [2022-04-08 10:05:07,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866345976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:07,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:07,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:05:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75538353] [2022-04-08 10:05:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:07,144 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:07,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:07,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:07,163 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:05:07,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:05:07,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:07,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:05:07,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1221, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:05:07,163 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:10,138 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2022-04-08 10:05:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:05:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-04-08 10:05:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 79 transitions. [2022-04-08 10:05:10,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 79 transitions. [2022-04-08 10:05:10,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:10,188 INFO L225 Difference]: With dead ends: 103 [2022-04-08 10:05:10,188 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 10:05:10,189 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=731, Invalid=2691, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:05:10,189 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:10,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 128 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:05:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 10:05:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 47. [2022-04-08 10:05:10,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:10,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:10,488 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:10,488 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:10,489 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-04-08 10:05:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-04-08 10:05:10,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:10,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:10,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 98 states. [2022-04-08 10:05:10,489 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 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 98 states. [2022-04-08 10:05:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:10,490 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2022-04-08 10:05:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2022-04-08 10:05:10,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:10,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:10,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:10,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:05:10,491 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2022-04-08 10:05:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:10,491 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:05:10,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:10,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:05:11,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:05:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:05:11,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:11,116 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:11,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:11,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:11,333 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1529085929, now seen corresponding path program 31 times [2022-04-08 10:05:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:11,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [103869913] [2022-04-08 10:05:11,335 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:11,335 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1529085929, now seen corresponding path program 32 times [2022-04-08 10:05:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:11,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42947528] [2022-04-08 10:05:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {43037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {43014#true} is VALID [2022-04-08 10:05:11,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-08 10:05:11,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-08 10:05:11,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {43014#true} call ULTIMATE.init(); {43037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:11,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {43037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {43014#true} is VALID [2022-04-08 10:05:11,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-08 10:05:11,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-08 10:05:11,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {43014#true} call #t~ret9 := main(); {43014#true} is VALID [2022-04-08 10:05:11,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {43014#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43019#(= main_~y~0 0)} is VALID [2022-04-08 10:05:11,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {43019#(= 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; {43020#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:11,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {43020#(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; {43021#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:11,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {43021#(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; {43022#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:11,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {43022#(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; {43023#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:11,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {43023#(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; {43024#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:11,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {43024#(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; {43025#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:11,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {43025#(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; {43026#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:11,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {43026#(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; {43027#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:11,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {43027#(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; {43028#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:11,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {43028#(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; {43029#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:11,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {43029#(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; {43030#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:11,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {43030#(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; {43031#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:11,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {43031#(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; {43032#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:11,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {43032#(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; {43033#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:11,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {43033#(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; {43034#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:11,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {43034#(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; {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:11,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:11,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {43036#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:11,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {43036#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {43015#false} is VALID [2022-04-08 10:05:11,536 INFO L272 TraceCheckUtils]: 25: Hoare triple {43015#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43015#false} is VALID [2022-04-08 10:05:11,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {43015#false} ~cond := #in~cond; {43015#false} is VALID [2022-04-08 10:05:11,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {43015#false} assume 0 == ~cond; {43015#false} is VALID [2022-04-08 10:05:11,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {43015#false} assume !false; {43015#false} is VALID [2022-04-08 10:05:11,537 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:05:11,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:11,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42947528] [2022-04-08 10:05:11,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42947528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:11,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800096663] [2022-04-08 10:05:11,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:11,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:11,538 INFO L229 MonitoredProcess]: Starting monitored process 88 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:05:11,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-04-08 10:05:11,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:11,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:11,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:05:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:11,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {43014#true} call ULTIMATE.init(); {43014#true} is VALID [2022-04-08 10:05:11,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {43014#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); {43014#true} is VALID [2022-04-08 10:05:11,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-08 10:05:11,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-08 10:05:11,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {43014#true} call #t~ret9 := main(); {43014#true} is VALID [2022-04-08 10:05:11,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {43014#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43019#(= main_~y~0 0)} is VALID [2022-04-08 10:05:11,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {43019#(= 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; {43020#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:11,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {43020#(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; {43021#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:11,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {43021#(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; {43022#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:11,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {43022#(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; {43023#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:11,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {43023#(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; {43024#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:11,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {43024#(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; {43025#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:11,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {43025#(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; {43026#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:11,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {43026#(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; {43027#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:11,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {43027#(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; {43028#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:11,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {43028#(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; {43029#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:11,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {43029#(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; {43030#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:11,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {43030#(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; {43031#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:11,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {43031#(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; {43032#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:11,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {43032#(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; {43033#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:11,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {43033#(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; {43034#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:11,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {43034#(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; {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:11,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:11,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {43035#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {43110#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:05:11,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {43110#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {43015#false} is VALID [2022-04-08 10:05:11,773 INFO L272 TraceCheckUtils]: 25: Hoare triple {43015#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43015#false} is VALID [2022-04-08 10:05:11,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {43015#false} ~cond := #in~cond; {43015#false} is VALID [2022-04-08 10:05:11,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {43015#false} assume 0 == ~cond; {43015#false} is VALID [2022-04-08 10:05:11,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {43015#false} assume !false; {43015#false} is VALID [2022-04-08 10:05:11,774 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:05:11,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:12,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {43015#false} assume !false; {43015#false} is VALID [2022-04-08 10:05:12,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {43015#false} assume 0 == ~cond; {43015#false} is VALID [2022-04-08 10:05:12,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {43015#false} ~cond := #in~cond; {43015#false} is VALID [2022-04-08 10:05:12,438 INFO L272 TraceCheckUtils]: 25: Hoare triple {43015#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43015#false} is VALID [2022-04-08 10:05:12,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {43138#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43015#false} is VALID [2022-04-08 10:05:12,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {43142#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {43138#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:12,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {43142#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {43142#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:12,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {43149#(< 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; {43142#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:12,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {43153#(< 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; {43149#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:12,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {43157#(< 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; {43153#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:12,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {43161#(< 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; {43157#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:12,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {43165#(< 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; {43161#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:12,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {43169#(< 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; {43165#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {43173#(< 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; {43169#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:12,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {43177#(< 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; {43173#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {43181#(< 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; {43177#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:12,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {43185#(< 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; {43181#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:12,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {43189#(< 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; {43185#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:12,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {43193#(< 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; {43189#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:12,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {43197#(< 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; {43193#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:12,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {43201#(< 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; {43197#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:12,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {43205#(< 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; {43201#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:05:12,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {43209#(< 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; {43205#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:05:12,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {43014#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43209#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:05:12,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {43014#true} call #t~ret9 := main(); {43014#true} is VALID [2022-04-08 10:05:12,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43014#true} {43014#true} #50#return; {43014#true} is VALID [2022-04-08 10:05:12,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {43014#true} assume true; {43014#true} is VALID [2022-04-08 10:05:12,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {43014#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); {43014#true} is VALID [2022-04-08 10:05:12,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {43014#true} call ULTIMATE.init(); {43014#true} is VALID [2022-04-08 10:05:12,453 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:05:12,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800096663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:12,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:12,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:05:12,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:12,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [103869913] [2022-04-08 10:05:12,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [103869913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:12,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:12,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:05:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112391175] [2022-04-08 10:05:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:12,454 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:12,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:12,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:12,476 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:05:12,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:05:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:05:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:05:12,477 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:16,036 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2022-04-08 10:05:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:05:16,036 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 83 transitions. [2022-04-08 10:05:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 83 transitions. [2022-04-08 10:05:16,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 83 transitions. [2022-04-08 10:05:16,112 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:05:16,113 INFO L225 Difference]: With dead ends: 108 [2022-04-08 10:05:16,114 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 10:05:16,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 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:05:16,114 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 80 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:16,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 136 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:05:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 10:05:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 49. [2022-04-08 10:05:16,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:16,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 49 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:16,482 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 49 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:16,482 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 49 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:16,484 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-08 10:05:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-08 10:05:16,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:16,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:16,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 3 states have call successors, (3), 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 103 states. [2022-04-08 10:05:16,484 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 3 states have call successors, (3), 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 103 states. [2022-04-08 10:05:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:16,485 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-08 10:05:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-08 10:05:16,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:16,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:16,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:16,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-04-08 10:05:16,486 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 29 [2022-04-08 10:05:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:16,486 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-04-08 10:05:16,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 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:05:16,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 59 transitions. [2022-04-08 10:05:17,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-08 10:05:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:17,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:17,156 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:17,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:17,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:17,370 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 117927339, now seen corresponding path program 143 times [2022-04-08 10:05:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:17,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923630460] [2022-04-08 10:05:17,372 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:17,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash 117927339, now seen corresponding path program 144 times [2022-04-08 10:05:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:17,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426216217] [2022-04-08 10:05:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:17,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {43809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {43786#true} is VALID [2022-04-08 10:05:17,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-08 10:05:17,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-08 10:05:17,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {43786#true} call ULTIMATE.init(); {43809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:17,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {43809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {43786#true} is VALID [2022-04-08 10:05:17,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-08 10:05:17,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-08 10:05:17,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {43786#true} call #t~ret9 := main(); {43786#true} is VALID [2022-04-08 10:05:17,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {43786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43791#(= main_~y~0 0)} is VALID [2022-04-08 10:05:17,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {43791#(= 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; {43792#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:17,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {43792#(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; {43793#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:17,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {43793#(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; {43794#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:17,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {43794#(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; {43795#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:17,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {43795#(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; {43796#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:17,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {43796#(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; {43797#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:17,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {43797#(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; {43798#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:17,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {43798#(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; {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:17,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:17,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {43800#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:17,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {43800#(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; {43801#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:17,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {43801#(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; {43802#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:17,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {43802#(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; {43803#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:17,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {43803#(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; {43804#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:17,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {43804#(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; {43805#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:17,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {43805#(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; {43806#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:17,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {43806#(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; {43807#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:05:17,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {43807#(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; {43808#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:05:17,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {43808#(and (<= main_~z~0 0) (<= 0 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; {43787#false} is VALID [2022-04-08 10:05:17,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {43787#false} assume !(~z~0 % 4294967296 > 0); {43787#false} is VALID [2022-04-08 10:05:17,669 INFO L272 TraceCheckUtils]: 26: Hoare triple {43787#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43787#false} is VALID [2022-04-08 10:05:17,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {43787#false} ~cond := #in~cond; {43787#false} is VALID [2022-04-08 10:05:17,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {43787#false} assume 0 == ~cond; {43787#false} is VALID [2022-04-08 10:05:17,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {43787#false} assume !false; {43787#false} is VALID [2022-04-08 10:05:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:17,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:17,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426216217] [2022-04-08 10:05:17,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426216217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:17,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349051259] [2022-04-08 10:05:17,670 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:17,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:17,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:17,671 INFO L229 MonitoredProcess]: Starting monitored process 89 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:05:17,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-04-08 10:05:17,748 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:05:17,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:17,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:17,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:18,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {43786#true} call ULTIMATE.init(); {43786#true} is VALID [2022-04-08 10:05:18,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {43786#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); {43786#true} is VALID [2022-04-08 10:05:18,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-08 10:05:18,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-08 10:05:18,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {43786#true} call #t~ret9 := main(); {43786#true} is VALID [2022-04-08 10:05:18,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {43786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43791#(= main_~y~0 0)} is VALID [2022-04-08 10:05:18,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {43791#(= 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; {43792#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:18,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {43792#(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; {43793#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:18,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {43793#(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; {43794#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:18,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {43794#(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; {43795#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:18,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {43795#(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; {43796#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:18,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {43796#(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; {43797#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:18,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {43797#(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; {43798#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:18,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {43798#(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; {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:18,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:18,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {43799#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {43800#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:18,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {43800#(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; {43801#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:18,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {43801#(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; {43802#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:18,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {43802#(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; {43803#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:18,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {43803#(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; {43804#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:18,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {43804#(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; {43805#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:18,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {43805#(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; {43806#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:18,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {43806#(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; {43807#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:05:18,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {43807#(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; {43808#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:05:18,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {43808#(and (<= main_~z~0 0) (<= 0 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; {43885#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:18,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {43885#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {43787#false} is VALID [2022-04-08 10:05:18,051 INFO L272 TraceCheckUtils]: 26: Hoare triple {43787#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43787#false} is VALID [2022-04-08 10:05:18,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {43787#false} ~cond := #in~cond; {43787#false} is VALID [2022-04-08 10:05:18,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {43787#false} assume 0 == ~cond; {43787#false} is VALID [2022-04-08 10:05:18,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {43787#false} assume !false; {43787#false} is VALID [2022-04-08 10:05:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:18,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:18,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {43787#false} assume !false; {43787#false} is VALID [2022-04-08 10:05:18,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {43787#false} assume 0 == ~cond; {43787#false} is VALID [2022-04-08 10:05:18,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {43787#false} ~cond := #in~cond; {43787#false} is VALID [2022-04-08 10:05:18,622 INFO L272 TraceCheckUtils]: 26: Hoare triple {43787#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43787#false} is VALID [2022-04-08 10:05:18,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {43913#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43787#false} is VALID [2022-04-08 10:05:18,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {43917#(< 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; {43913#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:18,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {43921#(< 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; {43917#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:18,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {43925#(< 0 (mod (+ main_~z~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; {43921#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:18,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {43929#(< 0 (mod (+ 4294967292 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; {43925#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:18,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {43933#(< 0 (mod (+ 4294967291 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; {43929#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:18,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {43937#(< 0 (mod (+ 4294967290 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; {43933#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:18,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {43941#(< 0 (mod (+ main_~z~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; {43937#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:18,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {43945#(< 0 (mod (+ 4294967288 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; {43941#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:18,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {43949#(< 0 (mod (+ main_~z~0 4294967287) 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; {43945#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:18,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {43953#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {43949#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:05:18,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {43953#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43953#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:05:18,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {43960#(< 0 (mod (+ 4294967288 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; {43953#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:05:18,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {43964#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43960#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:18,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {43968#(< 0 (mod (+ 4294967290 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; {43964#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:18,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {43972#(< 0 (mod (+ 4294967291 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; {43968#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:18,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {43976#(< 0 (mod (+ 4294967292 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; {43972#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:18,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {43980#(< 0 (mod (+ main_~y~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; {43976#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:18,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {43984#(< 0 (mod (+ main_~y~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; {43980#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:18,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {43988#(< 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; {43984#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:18,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {43786#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43988#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:18,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {43786#true} call #t~ret9 := main(); {43786#true} is VALID [2022-04-08 10:05:18,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43786#true} {43786#true} #50#return; {43786#true} is VALID [2022-04-08 10:05:18,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {43786#true} assume true; {43786#true} is VALID [2022-04-08 10:05:18,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {43786#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); {43786#true} is VALID [2022-04-08 10:05:18,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {43786#true} call ULTIMATE.init(); {43786#true} is VALID [2022-04-08 10:05:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:18,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349051259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:18,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:18,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2022-04-08 10:05:18,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:18,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923630460] [2022-04-08 10:05:18,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923630460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:18,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:18,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:05:18,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580235111] [2022-04-08 10:05:18,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:18,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:18,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:18,651 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:05:18,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:05:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:05:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:05:18,652 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:20,191 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-08 10:05:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:05:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 41 transitions. [2022-04-08 10:05:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 41 transitions. [2022-04-08 10:05:20,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 41 transitions. [2022-04-08 10:05:20,218 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:05:20,219 INFO L225 Difference]: With dead ends: 63 [2022-04-08 10:05:20,219 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 10:05:20,219 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=559, Invalid=2863, Unknown=0, NotChecked=0, Total=3422 [2022-04-08 10:05:20,220 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:20,220 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 104 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 10:05:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 10:05:20,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:20,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:20,500 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:20,501 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:20,501 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-08 10:05:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:05:20,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:20,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:20,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:05:20,501 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-08 10:05:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:20,502 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-08 10:05:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:05:20,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:20,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:20,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:20,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-08 10:05:20,502 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 30 [2022-04-08 10:05:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:20,503 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-08 10:05:20,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 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:05:20,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 56 transitions. [2022-04-08 10:05:21,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-08 10:05:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:21,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:21,095 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:21,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:21,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-04-08 10:05:21,295 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1103456948, now seen corresponding path program 145 times [2022-04-08 10:05:21,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:21,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094701117] [2022-04-08 10:05:21,298 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:21,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1103456948, now seen corresponding path program 146 times [2022-04-08 10:05:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:21,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438112829] [2022-04-08 10:05:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:21,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:21,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {44383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {44359#true} is VALID [2022-04-08 10:05:21,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-08 10:05:21,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-08 10:05:21,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {44359#true} call ULTIMATE.init(); {44383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:21,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {44383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {44359#true} is VALID [2022-04-08 10:05:21,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-08 10:05:21,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-08 10:05:21,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {44359#true} call #t~ret9 := main(); {44359#true} is VALID [2022-04-08 10:05:21,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {44359#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44364#(= main_~y~0 0)} is VALID [2022-04-08 10:05:21,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {44364#(= 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; {44365#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:21,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {44365#(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; {44366#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:21,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {44366#(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; {44367#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:21,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {44367#(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; {44368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:21,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {44368#(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; {44369#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:21,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {44369#(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; {44370#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:21,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {44370#(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; {44371#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:21,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {44371#(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; {44372#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:21,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {44372#(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; {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:21,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:21,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {44374#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:21,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {44374#(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; {44375#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:21,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {44375#(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; {44376#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:21,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {44376#(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; {44377#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:21,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {44377#(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; {44378#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:21,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {44378#(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; {44379#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:21,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {44379#(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; {44380#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:21,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {44380#(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; {44381#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:21,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {44381#(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; {44382#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:05:21,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {44382#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {44360#false} is VALID [2022-04-08 10:05:21,603 INFO L272 TraceCheckUtils]: 26: Hoare triple {44360#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44360#false} is VALID [2022-04-08 10:05:21,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {44360#false} ~cond := #in~cond; {44360#false} is VALID [2022-04-08 10:05:21,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#false} assume 0 == ~cond; {44360#false} is VALID [2022-04-08 10:05:21,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#false} assume !false; {44360#false} is VALID [2022-04-08 10:05:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438112829] [2022-04-08 10:05:21,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438112829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248763410] [2022-04-08 10:05:21,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:21,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:21,605 INFO L229 MonitoredProcess]: Starting monitored process 90 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:05:21,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-04-08 10:05:21,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:21,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:21,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:21,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:21,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {44359#true} call ULTIMATE.init(); {44359#true} is VALID [2022-04-08 10:05:21,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {44359#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); {44359#true} is VALID [2022-04-08 10:05:21,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-08 10:05:21,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-08 10:05:21,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {44359#true} call #t~ret9 := main(); {44359#true} is VALID [2022-04-08 10:05:21,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {44359#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44364#(= main_~y~0 0)} is VALID [2022-04-08 10:05:21,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {44364#(= 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; {44365#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:21,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {44365#(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; {44366#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:21,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {44366#(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; {44367#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:21,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {44367#(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; {44368#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:21,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {44368#(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; {44369#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:21,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {44369#(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; {44370#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:21,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {44370#(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; {44371#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:21,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {44371#(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; {44372#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:21,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {44372#(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; {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:21,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:21,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {44373#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {44374#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:21,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {44374#(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; {44375#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:21,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {44375#(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; {44376#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:21,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {44376#(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; {44377#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:21,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {44377#(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; {44378#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:21,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {44378#(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; {44379#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:21,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {44379#(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; {44380#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:21,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {44380#(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; {44381#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:21,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {44381#(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; {44459#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:05:21,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {44459#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {44360#false} is VALID [2022-04-08 10:05:21,907 INFO L272 TraceCheckUtils]: 26: Hoare triple {44360#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44360#false} is VALID [2022-04-08 10:05:21,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {44360#false} ~cond := #in~cond; {44360#false} is VALID [2022-04-08 10:05:21,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#false} assume 0 == ~cond; {44360#false} is VALID [2022-04-08 10:05:21,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#false} assume !false; {44360#false} is VALID [2022-04-08 10:05:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:21,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:22,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {44360#false} assume !false; {44360#false} is VALID [2022-04-08 10:05:22,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {44360#false} assume 0 == ~cond; {44360#false} is VALID [2022-04-08 10:05:22,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {44360#false} ~cond := #in~cond; {44360#false} is VALID [2022-04-08 10:05:22,348 INFO L272 TraceCheckUtils]: 26: Hoare triple {44360#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44360#false} is VALID [2022-04-08 10:05:22,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {44487#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {44360#false} is VALID [2022-04-08 10:05:22,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {44491#(< 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; {44487#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:22,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {44495#(< 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; {44491#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:22,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {44499#(< 0 (mod (+ main_~z~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; {44495#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:22,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {44503#(< 0 (mod (+ 4294967292 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; {44499#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:22,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {44507#(< 0 (mod (+ 4294967291 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; {44503#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:22,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {44511#(< 0 (mod (+ 4294967290 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; {44507#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:22,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {44515#(< 0 (mod (+ main_~z~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; {44511#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:22,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {44519#(< 0 (mod (+ 4294967288 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; {44515#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:22,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {44523#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {44519#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:22,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {44523#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {44523#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:22,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {44530#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {44523#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:22,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {44534#(< 0 (mod (+ 4294967290 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; {44530#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:22,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {44538#(< 0 (mod (+ 4294967291 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; {44534#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:22,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {44542#(< 0 (mod (+ 4294967292 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; {44538#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:22,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {44546#(< 0 (mod (+ main_~y~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; {44542#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:22,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {44550#(< 0 (mod (+ main_~y~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; {44546#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:22,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {44554#(< 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; {44550#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:22,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {44558#(< 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; {44554#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:22,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {44562#(< 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; {44558#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:22,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {44359#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44562#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:22,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {44359#true} call #t~ret9 := main(); {44359#true} is VALID [2022-04-08 10:05:22,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44359#true} {44359#true} #50#return; {44359#true} is VALID [2022-04-08 10:05:22,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {44359#true} assume true; {44359#true} is VALID [2022-04-08 10:05:22,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {44359#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); {44359#true} is VALID [2022-04-08 10:05:22,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {44359#true} call ULTIMATE.init(); {44359#true} is VALID [2022-04-08 10:05:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:22,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248763410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:22,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:22,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:22,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:22,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094701117] [2022-04-08 10:05:22,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094701117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:22,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:22,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:22,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501446976] [2022-04-08 10:05:22,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:22,360 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:22,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:22,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:22,374 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:05:22,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:22,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:22,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1467, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:22,374 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:23,740 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-04-08 10:05:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:05:23,740 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 44 transitions. [2022-04-08 10:05:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 44 transitions. [2022-04-08 10:05:23,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 44 transitions. [2022-04-08 10:05:23,762 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:05:23,763 INFO L225 Difference]: With dead ends: 62 [2022-04-08 10:05:23,763 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 10:05:23,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=612, Invalid=3048, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:05:23,763 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:23,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 10:05:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-04-08 10:05:24,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:24,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,120 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,120 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:24,121 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 10:05:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 10:05:24,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:24,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:24,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 57 states. [2022-04-08 10:05:24,122 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 57 states. [2022-04-08 10:05:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:24,122 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-04-08 10:05:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-04-08 10:05:24,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:24,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:24,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:24,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:05:24,123 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:05:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:24,123 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:05:24,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:24,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:05:24,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:05:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:24,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:24,927 INFO L499 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:24,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:25,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:25,147 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1004309109, now seen corresponding path program 147 times [2022-04-08 10:05:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:25,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039188169] [2022-04-08 10:05:25,152 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:25,152 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1004309109, now seen corresponding path program 148 times [2022-04-08 10:05:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:25,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587471151] [2022-04-08 10:05:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:25,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {44979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {44955#true} is VALID [2022-04-08 10:05:25,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-08 10:05:25,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-08 10:05:25,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {44955#true} call ULTIMATE.init(); {44979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:25,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {44979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {44955#true} is VALID [2022-04-08 10:05:25,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-08 10:05:25,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-08 10:05:25,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {44955#true} call #t~ret9 := main(); {44955#true} is VALID [2022-04-08 10:05:25,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {44955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44960#(= main_~y~0 0)} is VALID [2022-04-08 10:05:25,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {44960#(= 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; {44961#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:25,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {44961#(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; {44962#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:25,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {44962#(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; {44963#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:25,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {44963#(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; {44964#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:25,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {44964#(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; {44965#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:25,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {44965#(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; {44966#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:25,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {44966#(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; {44967#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:25,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {44967#(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; {44968#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:25,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {44968#(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; {44969#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:25,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {44969#(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; {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:25,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:25,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {44971#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:25,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {44971#(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; {44972#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:25,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {44972#(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; {44973#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:25,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {44973#(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; {44974#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:25,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {44974#(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; {44975#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:25,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {44975#(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; {44976#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:25,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {44976#(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; {44977#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:25,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {44977#(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; {44978#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:25,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {44978#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {44956#false} is VALID [2022-04-08 10:05:25,352 INFO L272 TraceCheckUtils]: 26: Hoare triple {44956#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44956#false} is VALID [2022-04-08 10:05:25,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {44956#false} ~cond := #in~cond; {44956#false} is VALID [2022-04-08 10:05:25,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {44956#false} assume 0 == ~cond; {44956#false} is VALID [2022-04-08 10:05:25,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {44956#false} assume !false; {44956#false} is VALID [2022-04-08 10:05:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:25,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587471151] [2022-04-08 10:05:25,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587471151] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:25,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24048283] [2022-04-08 10:05:25,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:25,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:25,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:25,353 INFO L229 MonitoredProcess]: Starting monitored process 91 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:05:25,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-04-08 10:05:25,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:25,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:25,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:25,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:25,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {44955#true} call ULTIMATE.init(); {44955#true} is VALID [2022-04-08 10:05:25,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {44955#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); {44955#true} is VALID [2022-04-08 10:05:25,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-08 10:05:25,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-08 10:05:25,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {44955#true} call #t~ret9 := main(); {44955#true} is VALID [2022-04-08 10:05:25,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {44955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44960#(= main_~y~0 0)} is VALID [2022-04-08 10:05:25,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {44960#(= 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; {44961#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:25,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {44961#(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; {44962#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:25,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {44962#(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; {44963#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:25,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {44963#(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; {44964#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:25,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {44964#(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; {44965#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:25,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {44965#(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; {44966#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:25,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {44966#(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; {44967#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:25,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {44967#(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; {44968#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:25,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {44968#(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; {44969#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:25,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {44969#(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; {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:25,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:25,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {44970#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {44971#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:25,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {44971#(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; {44972#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:25,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {44972#(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; {44973#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:25,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {44973#(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; {44974#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:25,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {44974#(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; {44975#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:25,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {44975#(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; {44976#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:25,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {44976#(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; {44977#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:25,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {44977#(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; {45055#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:25,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {45055#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {44956#false} is VALID [2022-04-08 10:05:25,573 INFO L272 TraceCheckUtils]: 26: Hoare triple {44956#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44956#false} is VALID [2022-04-08 10:05:25,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {44956#false} ~cond := #in~cond; {44956#false} is VALID [2022-04-08 10:05:25,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {44956#false} assume 0 == ~cond; {44956#false} is VALID [2022-04-08 10:05:25,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {44956#false} assume !false; {44956#false} is VALID [2022-04-08 10:05:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:25,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:26,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {44956#false} assume !false; {44956#false} is VALID [2022-04-08 10:05:26,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {44956#false} assume 0 == ~cond; {44956#false} is VALID [2022-04-08 10:05:26,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {44956#false} ~cond := #in~cond; {44956#false} is VALID [2022-04-08 10:05:26,004 INFO L272 TraceCheckUtils]: 26: Hoare triple {44956#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44956#false} is VALID [2022-04-08 10:05:26,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {45083#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {44956#false} is VALID [2022-04-08 10:05:26,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {45087#(< 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; {45083#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:26,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {45091#(< 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; {45087#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:26,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {45095#(< 0 (mod (+ main_~z~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; {45091#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:26,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {45099#(< 0 (mod (+ 4294967292 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; {45095#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:26,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {45103#(< 0 (mod (+ 4294967291 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; {45099#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:26,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {45107#(< 0 (mod (+ 4294967290 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; {45103#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:26,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {45111#(< 0 (mod (+ main_~z~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; {45107#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:26,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {45115#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {45111#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:26,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {45115#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45115#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:26,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {45122#(< 0 (mod (+ 4294967290 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; {45115#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:05:26,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {45126#(< 0 (mod (+ 4294967291 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; {45122#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:26,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {45130#(< 0 (mod (+ 4294967292 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; {45126#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:26,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {45134#(< 0 (mod (+ main_~y~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; {45130#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:26,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {45138#(< 0 (mod (+ main_~y~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; {45134#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:26,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {45142#(< 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; {45138#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:26,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {45146#(< 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; {45142#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:26,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {45150#(< 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; {45146#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:26,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {45154#(< 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; {45150#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:26,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {45158#(< 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; {45154#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:26,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {44955#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45158#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:26,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {44955#true} call #t~ret9 := main(); {44955#true} is VALID [2022-04-08 10:05:26,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44955#true} {44955#true} #50#return; {44955#true} is VALID [2022-04-08 10:05:26,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {44955#true} assume true; {44955#true} is VALID [2022-04-08 10:05:26,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {44955#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); {44955#true} is VALID [2022-04-08 10:05:26,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {44955#true} call ULTIMATE.init(); {44955#true} is VALID [2022-04-08 10:05:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:26,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24048283] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:26,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:26,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:26,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:26,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039188169] [2022-04-08 10:05:26,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039188169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:26,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:26,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:26,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446051779] [2022-04-08 10:05:26,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:26,018 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:26,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:26,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:26,035 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:05:26,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:26,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:26,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:26,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:26,036 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:27,741 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2022-04-08 10:05:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:05:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2022-04-08 10:05:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2022-04-08 10:05:27,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 56 transitions. [2022-04-08 10:05:27,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:27,772 INFO L225 Difference]: With dead ends: 71 [2022-04-08 10:05:27,772 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 10:05:27,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=804, Invalid=3752, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:05:27,772 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:27,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 84 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 10:05:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2022-04-08 10:05:28,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:28,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:28,079 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:28,079 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:28,080 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-08 10:05:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 10:05:28,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:28,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:28,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 66 states. [2022-04-08 10:05:28,080 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 66 states. [2022-04-08 10:05:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:28,081 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-08 10:05:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-08 10:05:28,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:28,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:28,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:28,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:05:28,081 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:05:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:28,081 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:05:28,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:28,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:05:28,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:05:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:28,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:28,934 INFO L499 BasicCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:28,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-04-08 10:05:29,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:29,148 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1416752788, now seen corresponding path program 149 times [2022-04-08 10:05:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256615742] [2022-04-08 10:05:29,150 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:29,150 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:29,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1416752788, now seen corresponding path program 150 times [2022-04-08 10:05:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:29,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079767817] [2022-04-08 10:05:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:29,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:29,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {45625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {45601#true} is VALID [2022-04-08 10:05:29,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-08 10:05:29,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-08 10:05:29,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {45601#true} call ULTIMATE.init(); {45625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:29,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {45625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {45601#true} is VALID [2022-04-08 10:05:29,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-08 10:05:29,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-08 10:05:29,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {45601#true} call #t~ret9 := main(); {45601#true} is VALID [2022-04-08 10:05:29,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {45601#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45606#(= main_~y~0 0)} is VALID [2022-04-08 10:05:29,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {45606#(= 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; {45607#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:29,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {45607#(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; {45608#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:29,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {45608#(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; {45609#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:29,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {45609#(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; {45610#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:29,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {45610#(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; {45611#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:29,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {45611#(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; {45612#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:29,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {45612#(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; {45613#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:29,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {45613#(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; {45614#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:29,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {45614#(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; {45615#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:29,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {45615#(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; {45616#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:29,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {45616#(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; {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:29,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:29,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {45618#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:29,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {45618#(and (<= main_~z~0 11) (<= 11 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; {45619#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:29,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {45619#(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; {45620#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:29,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {45620#(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; {45621#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:29,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {45621#(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; {45622#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:29,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {45622#(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; {45623#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:29,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {45623#(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; {45624#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:29,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {45624#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45602#false} is VALID [2022-04-08 10:05:29,359 INFO L272 TraceCheckUtils]: 26: Hoare triple {45602#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45602#false} is VALID [2022-04-08 10:05:29,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {45602#false} ~cond := #in~cond; {45602#false} is VALID [2022-04-08 10:05:29,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {45602#false} assume 0 == ~cond; {45602#false} is VALID [2022-04-08 10:05:29,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {45602#false} assume !false; {45602#false} is VALID [2022-04-08 10:05:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:29,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079767817] [2022-04-08 10:05:29,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079767817] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:29,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601623059] [2022-04-08 10:05:29,360 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:29,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:29,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:29,361 INFO L229 MonitoredProcess]: Starting monitored process 92 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:05:29,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-04-08 10:05:29,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:05:29,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:29,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:29,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:29,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {45601#true} call ULTIMATE.init(); {45601#true} is VALID [2022-04-08 10:05:29,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {45601#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); {45601#true} is VALID [2022-04-08 10:05:29,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-08 10:05:29,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-08 10:05:29,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {45601#true} call #t~ret9 := main(); {45601#true} is VALID [2022-04-08 10:05:29,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {45601#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45606#(= main_~y~0 0)} is VALID [2022-04-08 10:05:29,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {45606#(= 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; {45607#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:29,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {45607#(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; {45608#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:29,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {45608#(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; {45609#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:29,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {45609#(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; {45610#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:29,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {45610#(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; {45611#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:29,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {45611#(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; {45612#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:29,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {45612#(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; {45613#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:29,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {45613#(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; {45614#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:29,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {45614#(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; {45615#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:29,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {45615#(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; {45616#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:29,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {45616#(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; {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:29,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:29,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {45617#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {45618#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:29,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {45618#(and (<= main_~z~0 11) (<= 11 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; {45619#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:29,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {45619#(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; {45620#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:29,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {45620#(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; {45621#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:29,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {45621#(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; {45622#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:29,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {45622#(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; {45623#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:29,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {45623#(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; {45701#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:29,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {45701#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {45602#false} is VALID [2022-04-08 10:05:29,615 INFO L272 TraceCheckUtils]: 26: Hoare triple {45602#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45602#false} is VALID [2022-04-08 10:05:29,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {45602#false} ~cond := #in~cond; {45602#false} is VALID [2022-04-08 10:05:29,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {45602#false} assume 0 == ~cond; {45602#false} is VALID [2022-04-08 10:05:29,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {45602#false} assume !false; {45602#false} is VALID [2022-04-08 10:05:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:29,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:30,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {45602#false} assume !false; {45602#false} is VALID [2022-04-08 10:05:30,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {45602#false} assume 0 == ~cond; {45602#false} is VALID [2022-04-08 10:05:30,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {45602#false} ~cond := #in~cond; {45602#false} is VALID [2022-04-08 10:05:30,073 INFO L272 TraceCheckUtils]: 26: Hoare triple {45602#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45602#false} is VALID [2022-04-08 10:05:30,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {45729#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45602#false} is VALID [2022-04-08 10:05:30,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {45733#(< 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; {45729#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:30,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {45737#(< 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; {45733#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:30,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {45741#(< 0 (mod (+ main_~z~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; {45737#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:30,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {45745#(< 0 (mod (+ 4294967292 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; {45741#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:30,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {45749#(< 0 (mod (+ 4294967291 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; {45745#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:30,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {45753#(< 0 (mod (+ 4294967290 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; {45749#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:30,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {45757#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {45753#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:30,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {45757#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45757#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:30,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {45764#(< 0 (mod (+ 4294967291 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; {45757#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:30,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {45768#(< 0 (mod (+ 4294967292 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; {45764#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:30,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {45772#(< 0 (mod (+ main_~y~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; {45768#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:30,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {45776#(< 0 (mod (+ main_~y~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; {45772#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:30,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {45780#(< 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; {45776#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:30,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {45784#(< 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; {45780#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:30,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {45788#(< 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; {45784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:30,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {45792#(< 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; {45788#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:30,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {45796#(< 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; {45792#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:30,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {45800#(< 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; {45796#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:30,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {45804#(< 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; {45800#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:30,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {45601#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45804#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:30,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {45601#true} call #t~ret9 := main(); {45601#true} is VALID [2022-04-08 10:05:30,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45601#true} {45601#true} #50#return; {45601#true} is VALID [2022-04-08 10:05:30,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {45601#true} assume true; {45601#true} is VALID [2022-04-08 10:05:30,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {45601#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); {45601#true} is VALID [2022-04-08 10:05:30,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {45601#true} call ULTIMATE.init(); {45601#true} is VALID [2022-04-08 10:05:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:30,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601623059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:30,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:30,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:30,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:30,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256615742] [2022-04-08 10:05:30,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256615742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:30,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:30,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639793593] [2022-04-08 10:05:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:30,084 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:30,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:30,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:30,098 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:05:30,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:30,099 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:32,372 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-08 10:05:32,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:05:32,372 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:32,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2022-04-08 10:05:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2022-04-08 10:05:32,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 65 transitions. [2022-04-08 10:05:32,422 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:05:32,423 INFO L225 Difference]: With dead ends: 79 [2022-04-08 10:05:32,423 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 10:05:32,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=933, Invalid=4179, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 10:05:32,424 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:32,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 10:05:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2022-04-08 10:05:32,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:32,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:32,748 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:32,748 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:32,748 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-04-08 10:05:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-04-08 10:05:32,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:32,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:32,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 74 states. [2022-04-08 10:05:32,749 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 74 states. [2022-04-08 10:05:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:32,750 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-04-08 10:05:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-04-08 10:05:32,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:32,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:32,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:32,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:05:32,751 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:05:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:32,751 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:05:32,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:32,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:05:33,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:05:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:33,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:33,444 INFO L499 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:33,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:33,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:33,647 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 509605227, now seen corresponding path program 151 times [2022-04-08 10:05:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191616641] [2022-04-08 10:05:33,663 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:33,663 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:33,663 INFO L85 PathProgramCache]: Analyzing trace with hash 509605227, now seen corresponding path program 152 times [2022-04-08 10:05:33,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:33,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568696914] [2022-04-08 10:05:33,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:33,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:33,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {46311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {46287#true} is VALID [2022-04-08 10:05:33,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-08 10:05:33,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-08 10:05:34,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {46287#true} call ULTIMATE.init(); {46311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:34,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {46311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {46287#true} is VALID [2022-04-08 10:05:34,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-08 10:05:34,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-08 10:05:34,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {46287#true} call #t~ret9 := main(); {46287#true} is VALID [2022-04-08 10:05:34,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {46287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46292#(= main_~y~0 0)} is VALID [2022-04-08 10:05:34,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {46292#(= 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; {46293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:34,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {46293#(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; {46294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:34,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {46294#(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; {46295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:34,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {46295#(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; {46296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:34,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {46296#(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; {46297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:34,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {46297#(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; {46298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:34,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {46298#(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; {46299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:34,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {46299#(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; {46300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:34,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {46300#(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; {46301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:34,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {46301#(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; {46302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:34,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {46302#(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; {46303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:34,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {46303#(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; {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:34,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:34,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {46305#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:34,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {46305#(and (<= main_~z~0 12) (<= 12 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; {46306#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:34,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {46306#(and (<= main_~z~0 11) (<= 11 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; {46307#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:34,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {46307#(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; {46308#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:34,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {46308#(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; {46309#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:34,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {46309#(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; {46310#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:34,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {46310#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {46288#false} is VALID [2022-04-08 10:05:34,010 INFO L272 TraceCheckUtils]: 26: Hoare triple {46288#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46288#false} is VALID [2022-04-08 10:05:34,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {46288#false} ~cond := #in~cond; {46288#false} is VALID [2022-04-08 10:05:34,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {46288#false} assume 0 == ~cond; {46288#false} is VALID [2022-04-08 10:05:34,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {46288#false} assume !false; {46288#false} is VALID [2022-04-08 10:05:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:34,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:34,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568696914] [2022-04-08 10:05:34,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568696914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:34,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370784178] [2022-04-08 10:05:34,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:34,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:34,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:34,012 INFO L229 MonitoredProcess]: Starting monitored process 93 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:05:34,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-04-08 10:05:34,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:34,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:34,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:34,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:34,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {46287#true} call ULTIMATE.init(); {46287#true} is VALID [2022-04-08 10:05:34,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {46287#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); {46287#true} is VALID [2022-04-08 10:05:34,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-08 10:05:34,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-08 10:05:34,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {46287#true} call #t~ret9 := main(); {46287#true} is VALID [2022-04-08 10:05:34,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {46287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46292#(= main_~y~0 0)} is VALID [2022-04-08 10:05:34,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {46292#(= 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; {46293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:34,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {46293#(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; {46294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:34,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {46294#(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; {46295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:34,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {46295#(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; {46296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:34,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {46296#(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; {46297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:34,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {46297#(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; {46298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:34,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {46298#(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; {46299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:34,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {46299#(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; {46300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:34,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {46300#(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; {46301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:34,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {46301#(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; {46302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:34,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {46302#(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; {46303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:34,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {46303#(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; {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:34,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:34,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {46304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {46305#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:34,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {46305#(and (<= main_~z~0 12) (<= 12 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; {46306#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:34,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {46306#(and (<= main_~z~0 11) (<= 11 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; {46307#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:34,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {46307#(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; {46308#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:34,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {46308#(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; {46309#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:05:34,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {46309#(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; {46387#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:34,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {46387#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46288#false} is VALID [2022-04-08 10:05:34,253 INFO L272 TraceCheckUtils]: 26: Hoare triple {46288#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46288#false} is VALID [2022-04-08 10:05:34,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {46288#false} ~cond := #in~cond; {46288#false} is VALID [2022-04-08 10:05:34,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {46288#false} assume 0 == ~cond; {46288#false} is VALID [2022-04-08 10:05:34,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {46288#false} assume !false; {46288#false} is VALID [2022-04-08 10:05:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:34,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:34,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {46288#false} assume !false; {46288#false} is VALID [2022-04-08 10:05:34,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {46288#false} assume 0 == ~cond; {46288#false} is VALID [2022-04-08 10:05:34,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {46288#false} ~cond := #in~cond; {46288#false} is VALID [2022-04-08 10:05:34,682 INFO L272 TraceCheckUtils]: 26: Hoare triple {46288#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46288#false} is VALID [2022-04-08 10:05:34,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {46415#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46288#false} is VALID [2022-04-08 10:05:34,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {46419#(< 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; {46415#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:34,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {46423#(< 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; {46419#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:34,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {46427#(< 0 (mod (+ main_~z~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; {46423#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:34,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {46431#(< 0 (mod (+ 4294967292 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; {46427#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:34,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {46435#(< 0 (mod (+ 4294967291 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; {46431#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:34,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {46439#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {46435#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:34,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {46439#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46439#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:34,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {46446#(< 0 (mod (+ 4294967292 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; {46439#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:34,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {46450#(< 0 (mod (+ main_~y~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; {46446#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:34,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {46454#(< 0 (mod (+ main_~y~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; {46450#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:34,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {46458#(< 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; {46454#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:34,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {46462#(< 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; {46458#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:34,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {46466#(< 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; {46462#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:34,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {46470#(< 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; {46466#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:34,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {46474#(< 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; {46470#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:34,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {46478#(< 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; {46474#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:34,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {46482#(< 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; {46478#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:34,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {46486#(< 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; {46482#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:34,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {46490#(< 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; {46486#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:34,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {46287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46490#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:34,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {46287#true} call #t~ret9 := main(); {46287#true} is VALID [2022-04-08 10:05:34,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46287#true} {46287#true} #50#return; {46287#true} is VALID [2022-04-08 10:05:34,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {46287#true} assume true; {46287#true} is VALID [2022-04-08 10:05:34,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {46287#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); {46287#true} is VALID [2022-04-08 10:05:34,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {46287#true} call ULTIMATE.init(); {46287#true} is VALID [2022-04-08 10:05:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:34,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370784178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:34,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:34,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:34,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:34,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191616641] [2022-04-08 10:05:34,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191616641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:34,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:34,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277388828] [2022-04-08 10:05:34,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:34,693 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:34,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:34,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:34,717 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:05:34,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:34,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:34,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:34,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:34,718 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:37,289 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-08 10:05:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:05:37,289 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-08 10:05:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 71 transitions. [2022-04-08 10:05:37,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 71 transitions. [2022-04-08 10:05:37,335 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:05:37,336 INFO L225 Difference]: With dead ends: 86 [2022-04-08 10:05:37,336 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 10:05:37,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=985, Invalid=4271, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:05:37,336 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:37,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:05:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 10:05:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2022-04-08 10:05:37,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:37,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,663 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,663 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:37,664 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-08 10:05:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-08 10:05:37,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:37,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:37,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 81 states. [2022-04-08 10:05:37,664 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 81 states. [2022-04-08 10:05:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:37,665 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-08 10:05:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-08 10:05:37,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:37,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:37,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:37,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:05:37,666 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:05:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:37,666 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:05:37,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:37,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:05:38,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:05:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:38,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:38,348 INFO L499 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:38,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:38,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:38,564 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:38,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash 433198476, now seen corresponding path program 153 times [2022-04-08 10:05:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:38,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1575592562] [2022-04-08 10:05:38,568 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:38,568 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash 433198476, now seen corresponding path program 154 times [2022-04-08 10:05:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:38,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146341105] [2022-04-08 10:05:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:38,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:38,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {47027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {47003#true} is VALID [2022-04-08 10:05:38,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-08 10:05:38,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-08 10:05:38,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {47003#true} call ULTIMATE.init(); {47027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:38,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {47027#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {47003#true} is VALID [2022-04-08 10:05:38,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-08 10:05:38,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-08 10:05:38,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {47003#true} call #t~ret9 := main(); {47003#true} is VALID [2022-04-08 10:05:38,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {47003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47008#(= main_~y~0 0)} is VALID [2022-04-08 10:05:38,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {47008#(= 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; {47009#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:38,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {47009#(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; {47010#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:38,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {47010#(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; {47011#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:38,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {47011#(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; {47012#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:38,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {47012#(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; {47013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:38,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {47013#(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; {47014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:38,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {47014#(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; {47015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:38,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {47015#(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; {47016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:38,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {47016#(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; {47017#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:38,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {47017#(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; {47018#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:38,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {47018#(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; {47019#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:38,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {47019#(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; {47020#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:38,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {47020#(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; {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:38,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:38,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {47022#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:05:38,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {47022#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47023#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:38,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {47023#(and (<= main_~z~0 12) (<= 12 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; {47024#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:38,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {47024#(and (<= main_~z~0 11) (<= 11 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; {47025#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:38,810 INFO L290 TraceCheckUtils]: 24: Hoare triple {47025#(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; {47026#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:38,810 INFO L290 TraceCheckUtils]: 25: Hoare triple {47026#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {47004#false} is VALID [2022-04-08 10:05:38,828 INFO L272 TraceCheckUtils]: 26: Hoare triple {47004#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47004#false} is VALID [2022-04-08 10:05:38,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#false} ~cond := #in~cond; {47004#false} is VALID [2022-04-08 10:05:38,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {47004#false} assume 0 == ~cond; {47004#false} is VALID [2022-04-08 10:05:38,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {47004#false} assume !false; {47004#false} is VALID [2022-04-08 10:05:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:38,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146341105] [2022-04-08 10:05:38,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146341105] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:38,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886759516] [2022-04-08 10:05:38,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:38,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:38,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:38,832 INFO L229 MonitoredProcess]: Starting monitored process 94 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:05:38,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-04-08 10:05:38,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:38,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:38,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:38,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:39,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {47003#true} call ULTIMATE.init(); {47003#true} is VALID [2022-04-08 10:05:39,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {47003#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); {47003#true} is VALID [2022-04-08 10:05:39,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-08 10:05:39,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-08 10:05:39,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {47003#true} call #t~ret9 := main(); {47003#true} is VALID [2022-04-08 10:05:39,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {47003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47008#(= main_~y~0 0)} is VALID [2022-04-08 10:05:39,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {47008#(= 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; {47009#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:39,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {47009#(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; {47010#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:39,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {47010#(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; {47011#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:39,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {47011#(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; {47012#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:39,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {47012#(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; {47013#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:39,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {47013#(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; {47014#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:39,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {47014#(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; {47015#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:39,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {47015#(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; {47016#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:39,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {47016#(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; {47017#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:39,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {47017#(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; {47018#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:39,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {47018#(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; {47019#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:39,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {47019#(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; {47020#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:39,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {47020#(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; {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:39,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:39,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {47021#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {47022#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:05:39,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {47022#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47023#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:39,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {47023#(and (<= main_~z~0 12) (<= 12 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; {47024#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:39,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {47024#(and (<= main_~z~0 11) (<= 11 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; {47025#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:05:39,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {47025#(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; {47103#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:05:39,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {47103#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {47004#false} is VALID [2022-04-08 10:05:39,140 INFO L272 TraceCheckUtils]: 26: Hoare triple {47004#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47004#false} is VALID [2022-04-08 10:05:39,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#false} ~cond := #in~cond; {47004#false} is VALID [2022-04-08 10:05:39,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {47004#false} assume 0 == ~cond; {47004#false} is VALID [2022-04-08 10:05:39,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {47004#false} assume !false; {47004#false} is VALID [2022-04-08 10:05:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:39,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:39,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {47004#false} assume !false; {47004#false} is VALID [2022-04-08 10:05:39,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {47004#false} assume 0 == ~cond; {47004#false} is VALID [2022-04-08 10:05:39,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {47004#false} ~cond := #in~cond; {47004#false} is VALID [2022-04-08 10:05:39,723 INFO L272 TraceCheckUtils]: 26: Hoare triple {47004#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47004#false} is VALID [2022-04-08 10:05:39,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {47131#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47004#false} is VALID [2022-04-08 10:05:39,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {47135#(< 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; {47131#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:39,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {47139#(< 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; {47135#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:39,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {47143#(< 0 (mod (+ main_~z~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; {47139#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:39,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {47147#(< 0 (mod (+ 4294967292 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; {47143#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:39,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {47151#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {47147#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:05:39,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {47151#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47151#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:39,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {47158#(< 0 (mod (+ main_~y~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; {47151#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:39,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {47162#(< 0 (mod (+ main_~y~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; {47158#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:39,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {47166#(< 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; {47162#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:39,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {47170#(< 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; {47166#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:39,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {47174#(< 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; {47170#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:39,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {47178#(< 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; {47174#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:39,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {47182#(< 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; {47178#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:39,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {47186#(< 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; {47182#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:39,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {47190#(< 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; {47186#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:39,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {47194#(< 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; {47190#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:39,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {47198#(< 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; {47194#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:39,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {47202#(< 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; {47198#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:39,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {47206#(< 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; {47202#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:39,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {47003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47206#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:39,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {47003#true} call #t~ret9 := main(); {47003#true} is VALID [2022-04-08 10:05:39,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47003#true} {47003#true} #50#return; {47003#true} is VALID [2022-04-08 10:05:39,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {47003#true} assume true; {47003#true} is VALID [2022-04-08 10:05:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {47003#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); {47003#true} is VALID [2022-04-08 10:05:39,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {47003#true} call ULTIMATE.init(); {47003#true} is VALID [2022-04-08 10:05:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:39,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886759516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:39,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:39,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:39,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:39,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1575592562] [2022-04-08 10:05:39,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1575592562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:39,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:39,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691437558] [2022-04-08 10:05:39,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:39,736 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:39,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:39,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:39,756 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:05:39,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:39,757 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:42,573 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-04-08 10:05:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:05:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-08 10:05:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. [2022-04-08 10:05:42,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 74 transitions. [2022-04-08 10:05:42,619 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:05:42,634 INFO L225 Difference]: With dead ends: 92 [2022-04-08 10:05:42,634 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 10:05:42,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=949, Invalid=4021, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:05:42,634 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:42,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 113 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:05:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 10:05:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 48. [2022-04-08 10:05:42,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:42,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:42,990 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:42,990 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:43,006 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-08 10:05:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-08 10:05:43,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:43,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:43,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 87 states. [2022-04-08 10:05:43,006 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 87 states. [2022-04-08 10:05:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:43,007 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-08 10:05:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-08 10:05:43,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:43,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:43,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:43,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:05:43,008 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:05:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:43,008 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:05:43,008 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:43,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:05:43,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:05:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:43,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:43,768 INFO L499 BasicCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:43,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:43,984 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:43,984 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1400565067, now seen corresponding path program 155 times [2022-04-08 10:05:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:43,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703380048] [2022-04-08 10:05:43,995 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:43,995 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:43,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1400565067, now seen corresponding path program 156 times [2022-04-08 10:05:43,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:43,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066301001] [2022-04-08 10:05:43,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:43,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:44,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {47763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {47739#true} is VALID [2022-04-08 10:05:44,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-08 10:05:44,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-08 10:05:44,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {47739#true} call ULTIMATE.init(); {47763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:44,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {47763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {47739#true} is VALID [2022-04-08 10:05:44,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-08 10:05:44,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-08 10:05:44,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {47739#true} call #t~ret9 := main(); {47739#true} is VALID [2022-04-08 10:05:44,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {47739#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47744#(= main_~y~0 0)} is VALID [2022-04-08 10:05:44,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {47744#(= 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; {47745#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:44,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {47745#(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; {47746#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:44,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {47746#(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; {47747#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:44,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {47747#(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; {47748#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:44,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {47748#(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; {47749#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:44,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {47749#(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; {47750#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:44,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {47750#(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; {47751#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:44,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {47751#(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; {47752#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:44,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {47752#(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; {47753#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:44,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {47753#(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; {47754#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:44,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {47754#(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; {47755#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:44,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {47755#(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; {47756#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:44,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {47756#(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; {47757#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:44,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {47757#(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; {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:44,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:44,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {47759#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:05:44,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {47759#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:05:44,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {47760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47761#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:44,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {47761#(and (<= main_~z~0 12) (<= 12 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; {47762#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:44,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {47762#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {47740#false} is VALID [2022-04-08 10:05:44,306 INFO L272 TraceCheckUtils]: 26: Hoare triple {47740#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47740#false} is VALID [2022-04-08 10:05:44,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {47740#false} ~cond := #in~cond; {47740#false} is VALID [2022-04-08 10:05:44,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {47740#false} assume 0 == ~cond; {47740#false} is VALID [2022-04-08 10:05:44,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {47740#false} assume !false; {47740#false} is VALID [2022-04-08 10:05:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066301001] [2022-04-08 10:05:44,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066301001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:44,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781369525] [2022-04-08 10:05:44,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:44,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:44,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:44,307 INFO L229 MonitoredProcess]: Starting monitored process 95 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:05:44,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-04-08 10:05:44,492 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:05:44,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:44,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:44,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:44,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {47739#true} call ULTIMATE.init(); {47739#true} is VALID [2022-04-08 10:05:44,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {47739#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); {47739#true} is VALID [2022-04-08 10:05:44,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-08 10:05:44,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-08 10:05:44,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {47739#true} call #t~ret9 := main(); {47739#true} is VALID [2022-04-08 10:05:44,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {47739#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47744#(= main_~y~0 0)} is VALID [2022-04-08 10:05:44,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {47744#(= 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; {47745#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:44,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {47745#(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; {47746#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:44,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {47746#(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; {47747#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:44,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {47747#(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; {47748#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:44,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {47748#(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; {47749#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:44,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {47749#(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; {47750#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:44,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {47750#(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; {47751#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:44,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {47751#(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; {47752#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:44,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {47752#(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; {47753#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:44,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {47753#(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; {47754#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:44,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {47754#(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; {47755#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:44,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {47755#(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; {47756#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:44,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {47756#(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; {47757#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:44,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {47757#(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; {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:44,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:44,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {47758#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {47759#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:05:44,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {47759#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:05:44,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {47760#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47761#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:05:44,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {47761#(and (<= main_~z~0 12) (<= 12 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; {47839#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:05:44,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {47839#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {47740#false} is VALID [2022-04-08 10:05:44,682 INFO L272 TraceCheckUtils]: 26: Hoare triple {47740#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47740#false} is VALID [2022-04-08 10:05:44,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {47740#false} ~cond := #in~cond; {47740#false} is VALID [2022-04-08 10:05:44,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {47740#false} assume 0 == ~cond; {47740#false} is VALID [2022-04-08 10:05:44,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {47740#false} assume !false; {47740#false} is VALID [2022-04-08 10:05:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:44,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:45,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {47740#false} assume !false; {47740#false} is VALID [2022-04-08 10:05:45,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {47740#false} assume 0 == ~cond; {47740#false} is VALID [2022-04-08 10:05:45,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {47740#false} ~cond := #in~cond; {47740#false} is VALID [2022-04-08 10:05:45,213 INFO L272 TraceCheckUtils]: 26: Hoare triple {47740#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47740#false} is VALID [2022-04-08 10:05:45,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {47867#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47740#false} is VALID [2022-04-08 10:05:45,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {47871#(< 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; {47867#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:45,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {47875#(< 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; {47871#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:45,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {47879#(< 0 (mod (+ main_~z~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; {47875#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:45,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {47883#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {47879#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:45,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {47883#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47883#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:45,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {47890#(< 0 (mod (+ main_~y~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; {47883#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:45,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {47894#(< 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; {47890#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:45,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {47898#(< 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; {47894#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:45,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {47902#(< 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; {47898#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:45,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {47906#(< 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; {47902#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:45,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {47910#(< 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; {47906#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:45,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {47914#(< 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; {47910#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:45,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {47918#(< 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; {47914#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:45,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {47922#(< 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; {47918#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:45,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {47926#(< 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; {47922#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:45,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {47930#(< 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; {47926#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:45,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {47934#(< 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; {47930#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:45,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {47938#(< 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; {47934#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:45,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {47942#(< 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; {47938#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:45,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {47739#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47942#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:45,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {47739#true} call #t~ret9 := main(); {47739#true} is VALID [2022-04-08 10:05:45,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47739#true} {47739#true} #50#return; {47739#true} is VALID [2022-04-08 10:05:45,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {47739#true} assume true; {47739#true} is VALID [2022-04-08 10:05:45,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {47739#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); {47739#true} is VALID [2022-04-08 10:05:45,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {47739#true} call ULTIMATE.init(); {47739#true} is VALID [2022-04-08 10:05:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781369525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:45,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:45,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:45,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703380048] [2022-04-08 10:05:45,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703380048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:45,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:45,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720789690] [2022-04-08 10:05:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:45,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:45,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:45,246 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:05:45,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1396, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:45,246 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:48,775 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-04-08 10:05:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:05:48,775 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-08 10:05:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-08 10:05:48,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-08 10:05:48,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:48,818 INFO L225 Difference]: With dead ends: 97 [2022-04-08 10:05:48,818 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 10:05:48,819 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=869, Invalid=3553, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:05:48,819 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:48,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 118 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:05:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 10:05:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2022-04-08 10:05:49,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:49,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:49,152 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:49,152 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:49,153 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-08 10:05:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-08 10:05:49,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:49,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:49,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 92 states. [2022-04-08 10:05:49,153 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 92 states. [2022-04-08 10:05:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:49,154 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-08 10:05:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-08 10:05:49,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:49,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:49,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:49,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:05:49,155 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:05:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:49,155 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:05:49,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:49,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:05:49,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:05:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:49,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:49,953 INFO L499 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:49,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:50,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2022-04-08 10:05:50,157 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 461939116, now seen corresponding path program 157 times [2022-04-08 10:05:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:50,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125437616] [2022-04-08 10:05:50,159 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:50,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash 461939116, now seen corresponding path program 158 times [2022-04-08 10:05:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:50,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453858188] [2022-04-08 10:05:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:50,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {48487#true} is VALID [2022-04-08 10:05:50,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-08 10:05:50,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-08 10:05:50,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {48487#true} call ULTIMATE.init(); {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:50,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {48511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {48487#true} is VALID [2022-04-08 10:05:50,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-08 10:05:50,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-08 10:05:50,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {48487#true} call #t~ret9 := main(); {48487#true} is VALID [2022-04-08 10:05:50,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {48487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48492#(= main_~y~0 0)} is VALID [2022-04-08 10:05:50,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {48492#(= 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; {48493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:50,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {48493#(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; {48494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:50,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {48494#(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; {48495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:50,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {48495#(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; {48496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:50,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {48496#(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; {48497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:50,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {48497#(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; {48498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:50,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {48498#(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; {48499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:50,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {48499#(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; {48500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:50,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {48500#(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; {48501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:50,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {48501#(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; {48502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:50,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {48502#(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; {48503#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:50,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {48503#(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; {48504#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:50,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {48504#(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; {48505#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:50,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {48505#(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; {48506#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:50,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {48506#(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; {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:50,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:50,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {48508#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:05:50,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {48508#(and (<= main_~z~0 15) (<= 15 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; {48509#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:05:50,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {48509#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48510#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:50,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {48510#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {48488#false} is VALID [2022-04-08 10:05:50,433 INFO L272 TraceCheckUtils]: 26: Hoare triple {48488#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48488#false} is VALID [2022-04-08 10:05:50,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {48488#false} ~cond := #in~cond; {48488#false} is VALID [2022-04-08 10:05:50,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {48488#false} assume 0 == ~cond; {48488#false} is VALID [2022-04-08 10:05:50,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {48488#false} assume !false; {48488#false} is VALID [2022-04-08 10:05:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:50,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453858188] [2022-04-08 10:05:50,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453858188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:50,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226971200] [2022-04-08 10:05:50,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:50,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:50,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:50,436 INFO L229 MonitoredProcess]: Starting monitored process 96 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:05:50,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-04-08 10:05:50,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:50,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:50,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:50,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:50,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {48487#true} call ULTIMATE.init(); {48487#true} is VALID [2022-04-08 10:05:50,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {48487#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); {48487#true} is VALID [2022-04-08 10:05:50,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-08 10:05:50,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-08 10:05:50,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {48487#true} call #t~ret9 := main(); {48487#true} is VALID [2022-04-08 10:05:50,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {48487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48492#(= main_~y~0 0)} is VALID [2022-04-08 10:05:50,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {48492#(= 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; {48493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:50,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {48493#(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; {48494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:50,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {48494#(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; {48495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:50,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {48495#(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; {48496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:50,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {48496#(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; {48497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:50,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {48497#(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; {48498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:50,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {48498#(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; {48499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:50,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {48499#(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; {48500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:50,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {48500#(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; {48501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:50,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {48501#(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; {48502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:50,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {48502#(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; {48503#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:50,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {48503#(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; {48504#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:50,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {48504#(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; {48505#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:50,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {48505#(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; {48506#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:50,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {48506#(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; {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:50,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:50,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {48507#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {48508#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:05:50,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {48508#(and (<= main_~z~0 15) (<= 15 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; {48509#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:05:50,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {48509#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48587#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:05:50,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {48587#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {48488#false} is VALID [2022-04-08 10:05:50,715 INFO L272 TraceCheckUtils]: 26: Hoare triple {48488#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48488#false} is VALID [2022-04-08 10:05:50,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {48488#false} ~cond := #in~cond; {48488#false} is VALID [2022-04-08 10:05:50,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {48488#false} assume 0 == ~cond; {48488#false} is VALID [2022-04-08 10:05:50,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {48488#false} assume !false; {48488#false} is VALID [2022-04-08 10:05:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:50,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:51,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {48488#false} assume !false; {48488#false} is VALID [2022-04-08 10:05:51,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {48488#false} assume 0 == ~cond; {48488#false} is VALID [2022-04-08 10:05:51,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {48488#false} ~cond := #in~cond; {48488#false} is VALID [2022-04-08 10:05:51,179 INFO L272 TraceCheckUtils]: 26: Hoare triple {48488#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48488#false} is VALID [2022-04-08 10:05:51,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {48615#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48488#false} is VALID [2022-04-08 10:05:51,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {48619#(< 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; {48615#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:51,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {48623#(< 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; {48619#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:51,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {48627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {48623#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:51,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {48627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:51,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {48634#(< 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; {48627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:51,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {48638#(< 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; {48634#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:51,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {48642#(< 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; {48638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:51,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {48646#(< 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; {48642#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:51,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {48650#(< 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; {48646#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:51,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {48654#(< 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; {48650#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:51,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {48658#(< 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; {48654#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:51,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {48662#(< 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; {48658#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:51,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {48666#(< 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; {48662#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:51,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {48670#(< 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; {48666#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:51,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {48674#(< 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; {48670#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:51,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {48678#(< 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; {48674#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:51,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {48682#(< 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; {48678#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:51,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {48686#(< 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; {48682#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:51,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {48690#(< 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; {48686#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:51,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {48487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48690#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:51,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {48487#true} call #t~ret9 := main(); {48487#true} is VALID [2022-04-08 10:05:51,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48487#true} {48487#true} #50#return; {48487#true} is VALID [2022-04-08 10:05:51,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {48487#true} assume true; {48487#true} is VALID [2022-04-08 10:05:51,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {48487#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); {48487#true} is VALID [2022-04-08 10:05:51,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {48487#true} call ULTIMATE.init(); {48487#true} is VALID [2022-04-08 10:05:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:51,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226971200] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:51,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:51,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:51,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125437616] [2022-04-08 10:05:51,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125437616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:51,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:51,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551416973] [2022-04-08 10:05:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:51,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:51,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:51,218 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:05:51,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:51,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:51,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:51,218 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:54,161 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-08 10:05:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:05:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 77 transitions. [2022-04-08 10:05:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 77 transitions. [2022-04-08 10:05:54,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 77 transitions. [2022-04-08 10:05:54,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:54,222 INFO L225 Difference]: With dead ends: 101 [2022-04-08 10:05:54,222 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 10:05:54,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=822, Invalid=3210, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:05:54,223 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:54,223 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 133 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:05:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 10:05:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 48. [2022-04-08 10:05:54,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:54,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:54,678 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:54,678 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:54,679 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2022-04-08 10:05:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2022-04-08 10:05:54,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:54,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:54,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 96 states. [2022-04-08 10:05:54,679 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 96 states. [2022-04-08 10:05:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:54,680 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2022-04-08 10:05:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2022-04-08 10:05:54,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:54,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:54,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:54,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:05:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:05:54,681 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:05:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:54,681 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:05:54,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:54,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:05:55,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:05:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:05:55,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:55,402 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:55,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:55,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-04-08 10:05:55,617 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -122528469, now seen corresponding path program 159 times [2022-04-08 10:05:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:55,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319815641] [2022-04-08 10:05:55,619 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:55,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -122528469, now seen corresponding path program 160 times [2022-04-08 10:05:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:55,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830811881] [2022-04-08 10:05:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:55,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:55,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {49269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {49245#true} is VALID [2022-04-08 10:05:55,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-08 10:05:55,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-08 10:05:55,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {49245#true} call ULTIMATE.init(); {49269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:55,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {49269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {49245#true} is VALID [2022-04-08 10:05:55,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-08 10:05:55,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-08 10:05:55,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {49245#true} call #t~ret9 := main(); {49245#true} is VALID [2022-04-08 10:05:55,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {49245#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49250#(= main_~y~0 0)} is VALID [2022-04-08 10:05:55,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {49250#(= 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; {49251#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:55,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {49251#(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; {49252#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:55,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {49252#(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; {49253#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:55,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {49253#(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; {49254#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:55,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {49254#(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; {49255#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:55,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {49255#(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; {49256#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:55,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {49256#(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; {49257#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:55,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {49257#(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; {49258#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:55,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {49258#(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; {49259#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:55,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {49259#(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; {49260#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:55,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {49260#(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; {49261#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:55,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {49261#(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; {49262#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:55,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {49262#(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; {49263#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:55,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {49263#(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; {49264#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:55,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {49264#(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; {49265#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:55,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {49265#(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; {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:55,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:55,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49267#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:05:55,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {49267#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49268#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:05:55,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {49268#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {49246#false} is VALID [2022-04-08 10:05:55,828 INFO L272 TraceCheckUtils]: 26: Hoare triple {49246#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49246#false} is VALID [2022-04-08 10:05:55,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {49246#false} ~cond := #in~cond; {49246#false} is VALID [2022-04-08 10:05:55,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {49246#false} assume 0 == ~cond; {49246#false} is VALID [2022-04-08 10:05:55,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {49246#false} assume !false; {49246#false} is VALID [2022-04-08 10:05:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:55,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:55,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830811881] [2022-04-08 10:05:55,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830811881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:55,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146970047] [2022-04-08 10:05:55,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:55,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:55,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:55,830 INFO L229 MonitoredProcess]: Starting monitored process 97 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:05:55,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-04-08 10:05:55,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:55,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:55,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:55,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:56,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {49245#true} call ULTIMATE.init(); {49245#true} is VALID [2022-04-08 10:05:56,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {49245#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); {49245#true} is VALID [2022-04-08 10:05:56,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-08 10:05:56,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-08 10:05:56,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {49245#true} call #t~ret9 := main(); {49245#true} is VALID [2022-04-08 10:05:56,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {49245#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49250#(= main_~y~0 0)} is VALID [2022-04-08 10:05:56,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {49250#(= 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; {49251#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:56,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {49251#(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; {49252#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:56,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {49252#(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; {49253#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:56,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {49253#(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; {49254#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:56,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {49254#(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; {49255#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:56,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {49255#(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; {49256#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:56,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {49256#(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; {49257#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:56,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {49257#(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; {49258#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:56,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {49258#(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; {49259#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:56,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {49259#(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; {49260#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:56,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {49260#(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; {49261#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:56,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {49261#(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; {49262#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:56,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {49262#(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; {49263#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:56,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {49263#(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; {49264#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:56,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {49264#(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; {49265#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:56,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {49265#(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; {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:56,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:56,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {49266#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49267#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:05:56,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {49267#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49345#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:05:56,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {49345#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {49246#false} is VALID [2022-04-08 10:05:56,063 INFO L272 TraceCheckUtils]: 26: Hoare triple {49246#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49246#false} is VALID [2022-04-08 10:05:56,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {49246#false} ~cond := #in~cond; {49246#false} is VALID [2022-04-08 10:05:56,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {49246#false} assume 0 == ~cond; {49246#false} is VALID [2022-04-08 10:05:56,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {49246#false} assume !false; {49246#false} is VALID [2022-04-08 10:05:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:56,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:56,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {49246#false} assume !false; {49246#false} is VALID [2022-04-08 10:05:56,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {49246#false} assume 0 == ~cond; {49246#false} is VALID [2022-04-08 10:05:56,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {49246#false} ~cond := #in~cond; {49246#false} is VALID [2022-04-08 10:05:56,516 INFO L272 TraceCheckUtils]: 26: Hoare triple {49246#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49246#false} is VALID [2022-04-08 10:05:56,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {49373#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {49246#false} is VALID [2022-04-08 10:05:56,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {49377#(< 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; {49373#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:56,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {49381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {49377#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:56,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {49381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {49381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:56,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {49388#(< 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; {49381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:56,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {49392#(< 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; {49388#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:56,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {49396#(< 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; {49392#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:56,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {49400#(< 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; {49396#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:56,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {49404#(< 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; {49400#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:56,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {49408#(< 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; {49404#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:56,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {49412#(< 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; {49408#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:56,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {49416#(< 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; {49412#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:56,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {49420#(< 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; {49416#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:56,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {49424#(< 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; {49420#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:56,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {49428#(< 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; {49424#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:56,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {49432#(< 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; {49428#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:56,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {49436#(< 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; {49432#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:56,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {49440#(< 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; {49436#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:56,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {49444#(< 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; {49440#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:56,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {49448#(< 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; {49444#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:05:56,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {49245#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49448#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:05:56,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {49245#true} call #t~ret9 := main(); {49245#true} is VALID [2022-04-08 10:05:56,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49245#true} {49245#true} #50#return; {49245#true} is VALID [2022-04-08 10:05:56,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {49245#true} assume true; {49245#true} is VALID [2022-04-08 10:05:56,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {49245#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); {49245#true} is VALID [2022-04-08 10:05:56,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {49245#true} call ULTIMATE.init(); {49245#true} is VALID [2022-04-08 10:05:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:56,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146970047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:56,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:56,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:56,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:56,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319815641] [2022-04-08 10:05:56,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319815641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:56,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:56,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707344370] [2022-04-08 10:05:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:56,527 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:56,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:56,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:56,549 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:05:56,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:56,549 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:59,741 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2022-04-08 10:05:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:05:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2022-04-08 10:05:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:05:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 80 transitions. [2022-04-08 10:05:59,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 80 transitions. [2022-04-08 10:05:59,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:59,790 INFO L225 Difference]: With dead ends: 104 [2022-04-08 10:05:59,790 INFO L226 Difference]: Without dead ends: 99 [2022-04-08 10:05:59,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:05:59,791 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:59,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:05:59,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-08 10:06:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 48. [2022-04-08 10:06:00,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:00,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:00,156 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:00,156 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:00,157 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-04-08 10:06:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2022-04-08 10:06:00,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:00,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:00,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 99 states. [2022-04-08 10:06:00,158 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 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 99 states. [2022-04-08 10:06:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:00,158 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-04-08 10:06:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2022-04-08 10:06:00,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:00,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:00,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:00,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-08 10:06:00,159 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 30 [2022-04-08 10:06:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:00,159 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-08 10:06:00,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:00,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-08 10:06:00,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-08 10:06:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:06:00,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:00,937 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:00,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-04-08 10:06:01,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:01,146 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2075375052, now seen corresponding path program 33 times [2022-04-08 10:06:01,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:01,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041814185] [2022-04-08 10:06:01,148 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:01,148 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2075375052, now seen corresponding path program 34 times [2022-04-08 10:06:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:01,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733212602] [2022-04-08 10:06:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:01,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {50035#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {50011#true} is VALID [2022-04-08 10:06:01,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-08 10:06:01,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-08 10:06:01,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {50011#true} call ULTIMATE.init(); {50035#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:01,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {50035#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {50011#true} is VALID [2022-04-08 10:06:01,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-08 10:06:01,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-08 10:06:01,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {50011#true} call #t~ret9 := main(); {50011#true} is VALID [2022-04-08 10:06:01,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {50011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50016#(= main_~y~0 0)} is VALID [2022-04-08 10:06:01,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {50016#(= 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; {50017#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:01,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {50017#(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; {50018#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:01,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {50018#(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; {50019#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:01,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {50019#(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; {50020#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:01,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {50020#(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; {50021#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:01,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {50021#(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; {50022#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:01,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {50022#(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; {50023#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:01,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {50023#(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; {50024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:01,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {50024#(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; {50025#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:01,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {50025#(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; {50026#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:01,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {50026#(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; {50027#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:01,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {50027#(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; {50028#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:01,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {50028#(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; {50029#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:01,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {50029#(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; {50030#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:01,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {50030#(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; {50031#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:01,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {50031#(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; {50032#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:01,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {50032#(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; {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:01,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:01,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {50034#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:06:01,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {50034#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {50012#false} is VALID [2022-04-08 10:06:01,474 INFO L272 TraceCheckUtils]: 26: Hoare triple {50012#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50012#false} is VALID [2022-04-08 10:06:01,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {50012#false} ~cond := #in~cond; {50012#false} is VALID [2022-04-08 10:06:01,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {50012#false} assume 0 == ~cond; {50012#false} is VALID [2022-04-08 10:06:01,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {50012#false} assume !false; {50012#false} is VALID [2022-04-08 10:06:01,474 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:06:01,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:01,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733212602] [2022-04-08 10:06:01,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733212602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:01,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20682216] [2022-04-08 10:06:01,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:01,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:01,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:01,475 INFO L229 MonitoredProcess]: Starting monitored process 98 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:06:01,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-04-08 10:06:01,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:01,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:01,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:06:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:01,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:01,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {50011#true} call ULTIMATE.init(); {50011#true} is VALID [2022-04-08 10:06:01,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {50011#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); {50011#true} is VALID [2022-04-08 10:06:01,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-08 10:06:01,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-08 10:06:01,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {50011#true} call #t~ret9 := main(); {50011#true} is VALID [2022-04-08 10:06:01,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {50011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50016#(= main_~y~0 0)} is VALID [2022-04-08 10:06:01,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {50016#(= 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; {50017#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:01,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {50017#(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; {50018#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:01,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {50018#(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; {50019#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:01,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {50019#(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; {50020#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:01,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {50020#(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; {50021#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:01,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {50021#(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; {50022#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:01,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {50022#(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; {50023#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:01,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {50023#(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; {50024#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:01,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {50024#(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; {50025#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:01,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {50025#(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; {50026#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:01,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {50026#(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; {50027#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:01,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {50027#(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; {50028#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:01,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {50028#(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; {50029#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:01,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {50029#(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; {50030#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:01,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {50030#(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; {50031#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:01,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {50031#(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; {50032#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:01,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {50032#(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; {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:01,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:01,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {50033#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {50111#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:06:01,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {50111#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {50012#false} is VALID [2022-04-08 10:06:01,773 INFO L272 TraceCheckUtils]: 26: Hoare triple {50012#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50012#false} is VALID [2022-04-08 10:06:01,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {50012#false} ~cond := #in~cond; {50012#false} is VALID [2022-04-08 10:06:01,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {50012#false} assume 0 == ~cond; {50012#false} is VALID [2022-04-08 10:06:01,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {50012#false} assume !false; {50012#false} is VALID [2022-04-08 10:06:01,773 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:06:01,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:02,359 INFO L290 TraceCheckUtils]: 29: Hoare triple {50012#false} assume !false; {50012#false} is VALID [2022-04-08 10:06:02,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {50012#false} assume 0 == ~cond; {50012#false} is VALID [2022-04-08 10:06:02,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {50012#false} ~cond := #in~cond; {50012#false} is VALID [2022-04-08 10:06:02,360 INFO L272 TraceCheckUtils]: 26: Hoare triple {50012#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50012#false} is VALID [2022-04-08 10:06:02,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {50139#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {50012#false} is VALID [2022-04-08 10:06:02,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {50143#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {50139#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:02,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {50143#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {50143#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:02,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {50150#(< 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; {50143#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:02,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {50154#(< 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; {50150#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:02,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {50158#(< 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; {50154#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:02,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {50162#(< 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; {50158#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:02,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {50166#(< 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; {50162#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:02,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {50170#(< 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; {50166#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:02,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {50174#(< 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; {50170#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:02,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {50178#(< 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; {50174#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:02,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {50182#(< 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; {50178#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:02,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {50186#(< 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; {50182#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:02,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {50190#(< 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; {50186#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:02,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {50194#(< 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; {50190#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:06:02,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {50198#(< 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; {50194#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:06:02,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {50202#(< 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; {50198#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:06:02,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {50206#(< 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; {50202#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:06:02,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {50210#(< 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; {50206#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:06:02,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {50214#(< 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; {50210#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:06:02,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {50011#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50214#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:06:02,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {50011#true} call #t~ret9 := main(); {50011#true} is VALID [2022-04-08 10:06:02,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50011#true} {50011#true} #50#return; {50011#true} is VALID [2022-04-08 10:06:02,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {50011#true} assume true; {50011#true} is VALID [2022-04-08 10:06:02,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {50011#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); {50011#true} is VALID [2022-04-08 10:06:02,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {50011#true} call ULTIMATE.init(); {50011#true} is VALID [2022-04-08 10:06:02,371 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:06:02,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20682216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:02,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:02,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:06:02,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:02,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041814185] [2022-04-08 10:06:02,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041814185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:02,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:02,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:06:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527183150] [2022-04-08 10:06:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:02,372 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:02,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:02,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:02,387 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:06:02,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:06:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:06:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:06:02,388 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:06,111 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2022-04-08 10:06:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:06:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-08 10:06:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-04-08 10:06:06,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 84 transitions. [2022-04-08 10:06:06,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:06,155 INFO L225 Difference]: With dead ends: 109 [2022-04-08 10:06:06,155 INFO L226 Difference]: Without dead ends: 104 [2022-04-08 10:06:06,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:06:06,156 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 80 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:06,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 141 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:06:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-08 10:06:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 50. [2022-04-08 10:06:06,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:06,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 50 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:06,477 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 50 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:06,477 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 50 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:06,478 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-04-08 10:06:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-04-08 10:06:06,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:06,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:06,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 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 104 states. [2022-04-08 10:06:06,479 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 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 104 states. [2022-04-08 10:06:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:06,479 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-04-08 10:06:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-04-08 10:06:06,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:06,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:06,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:06,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-04-08 10:06:06,480 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 30 [2022-04-08 10:06:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:06,480 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-04-08 10:06:06,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 21 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:06:06,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 60 transitions. [2022-04-08 10:06:07,192 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:06:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-04-08 10:06:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:07,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:07,193 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:07,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-04-08 10:06:07,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:07,407 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:07,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:07,408 INFO L85 PathProgramCache]: Analyzing trace with hash 187068054, now seen corresponding path program 161 times [2022-04-08 10:06:07,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:07,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918138610] [2022-04-08 10:06:07,410 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:07,410 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 187068054, now seen corresponding path program 162 times [2022-04-08 10:06:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:07,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278050227] [2022-04-08 10:06:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:08,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {50826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {50799#true} is VALID [2022-04-08 10:06:08,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-08 10:06:08,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-08 10:06:08,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {50799#true} call ULTIMATE.init(); {50826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:08,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {50826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {50799#true} is VALID [2022-04-08 10:06:08,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-08 10:06:08,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-08 10:06:08,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {50799#true} call #t~ret9 := main(); {50799#true} is VALID [2022-04-08 10:06:08,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {50799#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50804#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:08,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {50804#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50805#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:08,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {50805#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {50806#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:08,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {50806#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~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; {50807#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:06:08,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {50807#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= 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; {50808#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:06:08,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {50808#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50809#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:06:08,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {50809#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= 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; {50810#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:06:08,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {50810#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50811#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:06:08,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {50811#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50812#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 8) main_~n~0))} is VALID [2022-04-08 10:06:08,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {50812#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 8) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50813#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 9)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:06:08,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {50813#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 9)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {50814#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 9)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:06:08,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {50814#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 9)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 4294967296) 4294967296) main_~x~0))} ~z~0 := ~y~0; {50814#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 9)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-08 10:06:08,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {50814#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= main_~n~0 (+ main_~x~0 9)) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 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; {50815#(and (<= (+ 1 (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:08,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {50815#(and (<= (+ 1 (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~n~0 (+ main_~x~0 8)) (<= main_~x~0 (+ (* (div main_~n~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; {50816#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 7 main_~x~0)) (<= (+ 2 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0))} is VALID [2022-04-08 10:06:08,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {50816#(and (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 7 main_~x~0)) (<= (+ 2 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 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; {50817#(and (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 3 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:08,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {50817#(and (<= main_~n~0 (+ main_~x~0 6)) (<= (+ 3 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~x~0 (+ 3 (* (div main_~n~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; {50818#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-08 10:06:08,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {50818#(and (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 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; {50819#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 5) main_~x~0))} is VALID [2022-04-08 10:06:08,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {50819#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 5) 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; {50820#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 6) main_~x~0))} is VALID [2022-04-08 10:06:08,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {50820#(and (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 6) 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; {50821#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 7) main_~x~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:08,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {50821#(and (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 7) main_~x~0) (<= main_~n~0 (+ main_~x~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; {50822#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 8) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 8)))} is VALID [2022-04-08 10:06:08,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {50822#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 8) main_~x~0) (<= main_~n~0 (+ main_~x~0 1)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 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; {50823#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:08,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {50823#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {50823#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:06:08,204 INFO L272 TraceCheckUtils]: 27: Hoare triple {50823#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50824#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:08,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {50824#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {50825#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:08,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {50825#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {50800#false} is VALID [2022-04-08 10:06:08,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {50800#false} assume !false; {50800#false} is VALID [2022-04-08 10:06:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:08,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278050227] [2022-04-08 10:06:08,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278050227] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:08,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796862530] [2022-04-08 10:06:08,205 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:08,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:08,206 INFO L229 MonitoredProcess]: Starting monitored process 99 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:06:08,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-04-08 10:06:08,544 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:06:08,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:08,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 10:06:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:08,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:09,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {50799#true} call ULTIMATE.init(); {50799#true} is VALID [2022-04-08 10:06:09,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {50799#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); {50799#true} is VALID [2022-04-08 10:06:09,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-08 10:06:09,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-08 10:06:09,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {50799#true} call #t~ret9 := main(); {50799#true} is VALID [2022-04-08 10:06:09,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {50799#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50804#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:06:09,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {50804#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50805#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:09,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {50805#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {50851#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 1) 4294967296) 4294967296))) (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:09,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {50851#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 1) 4294967296) 4294967296))) (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {50855#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:06:09,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {50855#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50859#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967295)))} is VALID [2022-04-08 10:06:09,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {50859#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967295)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50863#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~n~0 (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-08 10:06:09,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {50863#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~n~0 (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4294967295)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50867#(and (<= main_~n~0 (+ main_~x~0 6)) (<= main_~n~0 (+ 4294967295 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:06:09,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {50867#(and (<= main_~n~0 (+ main_~x~0 6)) (<= main_~n~0 (+ 4294967295 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50871#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div (+ main_~x~0 6) 4294967296)))) (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:06:09,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {50871#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div (+ main_~x~0 6) 4294967296)))) (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50875#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~n~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967295)) (<= (+ main_~x~0 8) main_~n~0))} is VALID [2022-04-08 10:06:09,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {50875#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~n~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967295)) (<= (+ main_~x~0 8) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {50879#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~n~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-08 10:06:09,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {50879#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~n~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {50879#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~n~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-08 10:06:09,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {50879#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~n~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967295)))} ~z~0 := ~y~0; {50879#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~n~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-08 10:06:09,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {50879#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~n~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967295)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50875#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~n~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967295)) (<= (+ main_~x~0 8) main_~n~0))} is VALID [2022-04-08 10:06:09,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {50875#(and (<= main_~n~0 (+ main_~x~0 8)) (<= main_~n~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967295)) (<= (+ main_~x~0 8) 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; {50871#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div (+ main_~x~0 6) 4294967296)))) (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:06:09,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {50871#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div (+ main_~x~0 6) 4294967296)))) (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 7 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; {50867#(and (<= main_~n~0 (+ main_~x~0 6)) (<= main_~n~0 (+ 4294967295 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:06:09,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {50867#(and (<= main_~n~0 (+ main_~x~0 6)) (<= main_~n~0 (+ 4294967295 (* (div (+ 5 main_~x~0) 4294967296) 4294967296))) (<= (+ main_~x~0 6) 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; {50863#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~n~0 (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-08 10:06:09,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {50863#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~n~0 (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4294967295)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50859#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967295)))} is VALID [2022-04-08 10:06:09,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {50859#(and (<= main_~n~0 (+ main_~x~0 4)) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967295)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50855#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:06:09,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {50855#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50851#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 1) 4294967296) 4294967296))) (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:06:10,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {50851#(and (<= main_~n~0 (+ 4294967295 (* (div (+ main_~x~0 1) 4294967296) 4294967296))) (<= (+ main_~x~0 2) main_~n~0) (<= main_~n~0 (+ main_~x~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; {50805#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:06:10,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {50805#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {50913#(and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0))} is VALID [2022-04-08 10:06:10,001 INFO L290 TraceCheckUtils]: 26: Hoare triple {50913#(and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0))} assume !(~z~0 % 4294967296 > 0); {50913#(and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0))} is VALID [2022-04-08 10:06:10,002 INFO L272 TraceCheckUtils]: 27: Hoare triple {50913#(and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:10,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {50920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:10,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {50924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50800#false} is VALID [2022-04-08 10:06:10,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {50800#false} assume !false; {50800#false} is VALID [2022-04-08 10:06:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:10,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:10,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {50800#false} assume !false; {50800#false} is VALID [2022-04-08 10:06:10,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {50924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50800#false} is VALID [2022-04-08 10:06:10,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {50920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:10,638 INFO L272 TraceCheckUtils]: 27: Hoare triple {50940#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:10,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {50940#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {50940#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:10,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {50947#(= (mod main_~n~0 4294967296) (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; {50940#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:06:10,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {50951#(= (mod main_~n~0 4294967296) (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; {50947#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:10,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {50955#(= (mod (+ main_~x~0 3) 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; {50951#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:10,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {50959#(= (mod main_~n~0 4294967296) (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; {50955#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:06:10,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {50963#(= (mod main_~n~0 4294967296) (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; {50959#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:06:10,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {50967#(= (mod main_~n~0 4294967296) (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; {50963#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:06:10,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {50971#(= (mod main_~n~0 4294967296) (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; {50967#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:06:10,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {50975#(= (mod main_~n~0 4294967296) (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; {50971#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:06:10,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {50979#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 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; {50975#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:06:10,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {50979#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 4294967296))} ~z~0 := ~y~0; {50979#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:06:10,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {50979#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 4294967296))} assume !(~x~0 % 4294967296 > 0); {50979#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:06:10,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {50975#(= (mod main_~n~0 4294967296) (mod (+ main_~x~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; {50979#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:06:10,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {50971#(= (mod main_~n~0 4294967296) (mod (+ 7 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; {50975#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:06:10,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {50967#(= (mod main_~n~0 4294967296) (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; {50971#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:06:10,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {50963#(= (mod main_~n~0 4294967296) (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; {50967#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:06:10,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {50959#(= (mod main_~n~0 4294967296) (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; {50963#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:06:10,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {50955#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~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; {50959#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:06:10,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {50951#(= (mod main_~n~0 4294967296) (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; {50955#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:06:10,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {50947#(= (mod main_~n~0 4294967296) (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; {50951#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:06:10,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {51013#(or (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)) (not (< 0 (mod 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; {50947#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:06:10,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {50799#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51013#(or (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:06:10,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {50799#true} call #t~ret9 := main(); {50799#true} is VALID [2022-04-08 10:06:10,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50799#true} {50799#true} #50#return; {50799#true} is VALID [2022-04-08 10:06:10,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {50799#true} assume true; {50799#true} is VALID [2022-04-08 10:06:10,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {50799#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); {50799#true} is VALID [2022-04-08 10:06:10,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {50799#true} call ULTIMATE.init(); {50799#true} is VALID [2022-04-08 10:06:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:10,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796862530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:10,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:10,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 15] total 47 [2022-04-08 10:06:10,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:10,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918138610] [2022-04-08 10:06:10,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918138610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:10,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:10,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:06:10,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20415894] [2022-04-08 10:06:10,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:10,654 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:06:10,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:10,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:10,743 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:06:10,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:06:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:06:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2007, Unknown=0, NotChecked=0, Total=2162 [2022-04-08 10:06:10,744 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:13,974 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-08 10:06:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:06:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-08 10:06:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2022-04-08 10:06:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 42 transitions. [2022-04-08 10:06:13,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 42 transitions. [2022-04-08 10:06:14,014 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:06:14,014 INFO L225 Difference]: With dead ends: 64 [2022-04-08 10:06:14,014 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 10:06:14,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=297, Invalid=4259, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:06:14,015 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:14,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:06:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 10:06:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2022-04-08 10:06:14,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:14,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,475 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,475 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:14,475 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 10:06:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 10:06:14,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:14,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:14,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 59 states. [2022-04-08 10:06:14,476 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 59 states. [2022-04-08 10:06:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:14,476 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-08 10:06:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-08 10:06:14,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:14,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:14,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:14,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:14,477 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:14,477 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:14,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.08) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:14,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:06:15,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:15,605 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:06:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:15,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:15,605 INFO L499 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:15,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-04-08 10:06:15,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-04-08 10:06:15,811 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1034316233, now seen corresponding path program 163 times [2022-04-08 10:06:15,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:15,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771144170] [2022-04-08 10:06:15,823 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:15,823 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1034316233, now seen corresponding path program 164 times [2022-04-08 10:06:15,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:15,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146007336] [2022-04-08 10:06:15,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {51449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {51424#true} is VALID [2022-04-08 10:06:16,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-08 10:06:16,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-08 10:06:16,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {51424#true} call ULTIMATE.init(); {51449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:16,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {51449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {51424#true} is VALID [2022-04-08 10:06:16,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-08 10:06:16,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-08 10:06:16,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {51424#true} call #t~ret9 := main(); {51424#true} is VALID [2022-04-08 10:06:16,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {51424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51429#(= main_~y~0 0)} is VALID [2022-04-08 10:06:16,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {51429#(= 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; {51430#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:16,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {51430#(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; {51431#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:16,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {51431#(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; {51432#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:16,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {51432#(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; {51433#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:16,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {51433#(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; {51434#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:16,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {51434#(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; {51435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:16,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {51435#(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; {51436#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:16,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {51436#(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; {51437#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:16,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {51437#(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; {51438#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {51438#(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; {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:16,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:16,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {51440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:16,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {51440#(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; {51441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:16,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {51441#(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; {51442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:16,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {51442#(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; {51443#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:16,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {51443#(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; {51444#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:16,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {51444#(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; {51445#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:16,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {51445#(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; {51446#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:16,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {51446#(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; {51447#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:16,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {51447#(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; {51448#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:16,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {51448#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {51425#false} is VALID [2022-04-08 10:06:16,158 INFO L272 TraceCheckUtils]: 27: Hoare triple {51425#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51425#false} is VALID [2022-04-08 10:06:16,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {51425#false} ~cond := #in~cond; {51425#false} is VALID [2022-04-08 10:06:16,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {51425#false} assume 0 == ~cond; {51425#false} is VALID [2022-04-08 10:06:16,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {51425#false} assume !false; {51425#false} is VALID [2022-04-08 10:06:16,158 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:06:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146007336] [2022-04-08 10:06:16,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146007336] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:16,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059864068] [2022-04-08 10:06:16,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:16,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:16,167 INFO L229 MonitoredProcess]: Starting monitored process 100 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:06:16,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-04-08 10:06:16,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:16,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:16,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:06:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:16,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:16,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {51424#true} call ULTIMATE.init(); {51424#true} is VALID [2022-04-08 10:06:16,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {51424#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); {51424#true} is VALID [2022-04-08 10:06:16,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-08 10:06:16,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-08 10:06:16,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {51424#true} call #t~ret9 := main(); {51424#true} is VALID [2022-04-08 10:06:16,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {51424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51429#(= main_~y~0 0)} is VALID [2022-04-08 10:06:16,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {51429#(= 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; {51430#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:16,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {51430#(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; {51431#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:16,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {51431#(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; {51432#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:16,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {51432#(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; {51433#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:16,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {51433#(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; {51434#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:16,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {51434#(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; {51435#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:16,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {51435#(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; {51436#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:16,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {51436#(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; {51437#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:16,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {51437#(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; {51438#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:16,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {51438#(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; {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:16,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:16,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {51439#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {51440#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:16,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {51440#(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; {51441#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:16,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {51441#(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; {51442#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:16,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {51442#(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; {51443#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:16,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {51443#(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; {51444#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:16,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {51444#(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; {51445#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:16,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {51445#(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; {51446#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:16,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {51446#(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; {51447#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:16,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {51447#(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; {51528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:16,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {51528#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {51425#false} is VALID [2022-04-08 10:06:16,425 INFO L272 TraceCheckUtils]: 27: Hoare triple {51425#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51425#false} is VALID [2022-04-08 10:06:16,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {51425#false} ~cond := #in~cond; {51425#false} is VALID [2022-04-08 10:06:16,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {51425#false} assume 0 == ~cond; {51425#false} is VALID [2022-04-08 10:06:16,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {51425#false} assume !false; {51425#false} is VALID [2022-04-08 10:06:16,426 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:06:16,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:16,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {51425#false} assume !false; {51425#false} is VALID [2022-04-08 10:06:16,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {51425#false} assume 0 == ~cond; {51425#false} is VALID [2022-04-08 10:06:16,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {51425#false} ~cond := #in~cond; {51425#false} is VALID [2022-04-08 10:06:16,986 INFO L272 TraceCheckUtils]: 27: Hoare triple {51425#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51425#false} is VALID [2022-04-08 10:06:16,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {51556#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {51425#false} is VALID [2022-04-08 10:06:16,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {51560#(< 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; {51556#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:16,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {51564#(< 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; {51560#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:16,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {51568#(< 0 (mod (+ main_~z~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; {51564#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:16,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {51572#(< 0 (mod (+ 4294967292 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; {51568#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:16,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {51576#(< 0 (mod (+ 4294967291 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; {51572#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:16,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {51580#(< 0 (mod (+ 4294967290 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; {51576#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:16,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {51584#(< 0 (mod (+ main_~z~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; {51580#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:16,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {51588#(< 0 (mod (+ 4294967288 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; {51584#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:06:16,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {51592#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {51588#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:16,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {51592#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {51592#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:16,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {51599#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51592#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:16,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {51603#(< 0 (mod (+ 4294967290 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; {51599#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:06:16,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {51607#(< 0 (mod (+ 4294967291 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; {51603#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:16,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {51611#(< 0 (mod (+ 4294967292 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; {51607#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:16,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {51615#(< 0 (mod (+ main_~y~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; {51611#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:16,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {51619#(< 0 (mod (+ main_~y~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; {51615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:16,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {51623#(< 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; {51619#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:16,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {51627#(< 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; {51623#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:16,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {51631#(< 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; {51627#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:17,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {51635#(< 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; {51631#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:17,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {51424#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51635#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:17,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {51424#true} call #t~ret9 := main(); {51424#true} is VALID [2022-04-08 10:06:17,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51424#true} {51424#true} #50#return; {51424#true} is VALID [2022-04-08 10:06:17,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {51424#true} assume true; {51424#true} is VALID [2022-04-08 10:06:17,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {51424#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); {51424#true} is VALID [2022-04-08 10:06:17,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {51424#true} call ULTIMATE.init(); {51424#true} is VALID [2022-04-08 10:06:17,000 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:06:17,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059864068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:17,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:17,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:17,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:17,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771144170] [2022-04-08 10:06:17,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771144170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:17,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:17,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040574634] [2022-04-08 10:06:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:17,001 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:17,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:17,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:17,019 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:06:17,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:17,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:17,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:17,019 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:19,528 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-08 10:06:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:06:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2022-04-08 10:06:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2022-04-08 10:06:19,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 58 transitions. [2022-04-08 10:06:19,573 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:06:19,574 INFO L225 Difference]: With dead ends: 76 [2022-04-08 10:06:19,574 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 10:06:19,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=884, Invalid=4228, Unknown=0, NotChecked=0, Total=5112 [2022-04-08 10:06:19,574 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:19,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:06:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 10:06:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2022-04-08 10:06:20,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:20,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,118 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,118 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:20,118 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-08 10:06:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-08 10:06:20,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:20,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:20,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 71 states. [2022-04-08 10:06:20,119 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 71 states. [2022-04-08 10:06:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:20,119 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-08 10:06:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-08 10:06:20,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:20,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:20,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:20,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:20,120 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:20,120 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:20,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:20,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:06:21,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:06:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:21,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:21,046 INFO L499 BasicCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:21,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:21,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:21,262 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:21,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash -935168394, now seen corresponding path program 165 times [2022-04-08 10:06:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:21,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448217396] [2022-04-08 10:06:21,264 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:21,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash -935168394, now seen corresponding path program 166 times [2022-04-08 10:06:21,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:21,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95864866] [2022-04-08 10:06:21,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:21,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:21,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {52133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {52108#true} is VALID [2022-04-08 10:06:21,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-08 10:06:21,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-08 10:06:21,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {52108#true} call ULTIMATE.init(); {52133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:21,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {52133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {52108#true} is VALID [2022-04-08 10:06:21,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-08 10:06:21,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-08 10:06:21,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {52108#true} call #t~ret9 := main(); {52108#true} is VALID [2022-04-08 10:06:21,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {52108#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52113#(= main_~y~0 0)} is VALID [2022-04-08 10:06:21,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {52113#(= 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; {52114#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:21,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {52114#(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; {52115#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:21,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {52115#(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; {52116#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:21,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {52116#(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; {52117#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:21,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {52117#(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; {52118#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:21,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {52118#(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; {52119#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:21,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {52119#(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; {52120#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:21,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {52120#(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; {52121#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:21,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {52121#(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; {52122#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:21,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {52122#(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; {52123#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:21,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {52123#(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; {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:21,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:21,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {52125#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:21,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {52125#(and (<= main_~z~0 11) (<= 11 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; {52126#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:21,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {52126#(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; {52127#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:21,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {52127#(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; {52128#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:21,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {52128#(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; {52129#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:21,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {52129#(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; {52130#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:21,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {52130#(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; {52131#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:21,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {52131#(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; {52132#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:21,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {52132#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {52109#false} is VALID [2022-04-08 10:06:21,595 INFO L272 TraceCheckUtils]: 27: Hoare triple {52109#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52109#false} is VALID [2022-04-08 10:06:21,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {52109#false} ~cond := #in~cond; {52109#false} is VALID [2022-04-08 10:06:21,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {52109#false} assume 0 == ~cond; {52109#false} is VALID [2022-04-08 10:06:21,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {52109#false} assume !false; {52109#false} is VALID [2022-04-08 10:06:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:21,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:21,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95864866] [2022-04-08 10:06:21,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95864866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:21,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115473180] [2022-04-08 10:06:21,596 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:21,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:21,613 INFO L229 MonitoredProcess]: Starting monitored process 101 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:06:21,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-04-08 10:06:21,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:21,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:21,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:06:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:21,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:21,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {52108#true} call ULTIMATE.init(); {52108#true} is VALID [2022-04-08 10:06:21,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {52108#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); {52108#true} is VALID [2022-04-08 10:06:21,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-08 10:06:21,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-08 10:06:21,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {52108#true} call #t~ret9 := main(); {52108#true} is VALID [2022-04-08 10:06:21,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {52108#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52113#(= main_~y~0 0)} is VALID [2022-04-08 10:06:21,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {52113#(= 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; {52114#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:21,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {52114#(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; {52115#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:21,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {52115#(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; {52116#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:21,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {52116#(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; {52117#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:21,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {52117#(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; {52118#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:21,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {52118#(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; {52119#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:21,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {52119#(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; {52120#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:21,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {52120#(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; {52121#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:21,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {52121#(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; {52122#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:21,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {52122#(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; {52123#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:21,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {52123#(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; {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:21,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:21,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {52124#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {52125#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:21,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {52125#(and (<= main_~z~0 11) (<= 11 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; {52126#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:21,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {52126#(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; {52127#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:21,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {52127#(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; {52128#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:21,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {52128#(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; {52129#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:21,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {52129#(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; {52130#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:21,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {52130#(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; {52131#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:21,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {52131#(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; {52212#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:21,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {52212#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {52109#false} is VALID [2022-04-08 10:06:21,873 INFO L272 TraceCheckUtils]: 27: Hoare triple {52109#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52109#false} is VALID [2022-04-08 10:06:21,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {52109#false} ~cond := #in~cond; {52109#false} is VALID [2022-04-08 10:06:21,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {52109#false} assume 0 == ~cond; {52109#false} is VALID [2022-04-08 10:06:21,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {52109#false} assume !false; {52109#false} is VALID [2022-04-08 10:06:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:21,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:22,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {52109#false} assume !false; {52109#false} is VALID [2022-04-08 10:06:22,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {52109#false} assume 0 == ~cond; {52109#false} is VALID [2022-04-08 10:06:22,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {52109#false} ~cond := #in~cond; {52109#false} is VALID [2022-04-08 10:06:22,316 INFO L272 TraceCheckUtils]: 27: Hoare triple {52109#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52109#false} is VALID [2022-04-08 10:06:22,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {52240#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {52109#false} is VALID [2022-04-08 10:06:22,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {52244#(< 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; {52240#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:22,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {52248#(< 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; {52244#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:22,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {52252#(< 0 (mod (+ main_~z~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; {52248#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:22,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {52256#(< 0 (mod (+ 4294967292 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; {52252#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:22,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {52260#(< 0 (mod (+ 4294967291 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; {52256#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:22,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {52264#(< 0 (mod (+ 4294967290 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; {52260#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:22,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {52268#(< 0 (mod (+ main_~z~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; {52264#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:22,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {52272#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {52268#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:06:22,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {52272#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {52272#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:06:22,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {52279#(< 0 (mod (+ 4294967290 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; {52272#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:06:22,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {52283#(< 0 (mod (+ 4294967291 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; {52279#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:22,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {52287#(< 0 (mod (+ 4294967292 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; {52283#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:22,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {52291#(< 0 (mod (+ main_~y~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; {52287#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:22,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {52295#(< 0 (mod (+ main_~y~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; {52291#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:22,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {52299#(< 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; {52295#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:22,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {52303#(< 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; {52299#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:22,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {52307#(< 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; {52303#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:22,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {52311#(< 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; {52307#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:22,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {52315#(< 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; {52311#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:22,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {52319#(< 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; {52315#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:22,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {52108#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52319#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:22,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {52108#true} call #t~ret9 := main(); {52108#true} is VALID [2022-04-08 10:06:22,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52108#true} {52108#true} #50#return; {52108#true} is VALID [2022-04-08 10:06:22,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {52108#true} assume true; {52108#true} is VALID [2022-04-08 10:06:22,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {52108#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); {52108#true} is VALID [2022-04-08 10:06:22,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {52108#true} call ULTIMATE.init(); {52108#true} is VALID [2022-04-08 10:06:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:22,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115473180] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:22,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:22,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:22,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448217396] [2022-04-08 10:06:22,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448217396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:22,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:22,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:22,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707419232] [2022-04-08 10:06:22,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:22,329 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:22,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:22,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:22,342 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:06:22,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:22,343 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:25,466 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-04-08 10:06:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:06:25,466 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 68 transitions. [2022-04-08 10:06:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 68 transitions. [2022-04-08 10:06:25,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 68 transitions. [2022-04-08 10:06:25,521 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:06:25,522 INFO L225 Difference]: With dead ends: 85 [2022-04-08 10:06:25,522 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 10:06:25,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1038, Invalid=4814, Unknown=0, NotChecked=0, Total=5852 [2022-04-08 10:06:25,523 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:25,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 122 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:06:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 10:06:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 51. [2022-04-08 10:06:26,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:26,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,087 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,087 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:26,087 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-08 10:06:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-08 10:06:26,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:26,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:26,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 80 states. [2022-04-08 10:06:26,088 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 80 states. [2022-04-08 10:06:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:26,088 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-04-08 10:06:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2022-04-08 10:06:26,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:26,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:26,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:26,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:26,089 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:26,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:26,089 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:26,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:26,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:06:27,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:06:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:27,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:27,029 INFO L499 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:27,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-04-08 10:06:27,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:27,243 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:27,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1347612073, now seen corresponding path program 167 times [2022-04-08 10:06:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:27,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2004779971] [2022-04-08 10:06:27,246 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:27,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1347612073, now seen corresponding path program 168 times [2022-04-08 10:06:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:27,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259059996] [2022-04-08 10:06:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {52863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {52838#true} is VALID [2022-04-08 10:06:27,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-08 10:06:27,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-08 10:06:27,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {52838#true} call ULTIMATE.init(); {52863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:27,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {52863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {52838#true} is VALID [2022-04-08 10:06:27,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-08 10:06:27,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-08 10:06:27,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {52838#true} call #t~ret9 := main(); {52838#true} is VALID [2022-04-08 10:06:27,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {52838#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52843#(= main_~y~0 0)} is VALID [2022-04-08 10:06:27,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {52843#(= 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; {52844#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:27,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {52844#(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; {52845#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:27,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {52845#(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; {52846#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:27,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {52846#(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; {52847#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:27,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {52847#(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; {52848#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:27,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {52848#(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; {52849#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {52849#(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; {52850#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:27,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {52850#(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; {52851#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:27,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {52851#(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; {52852#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:27,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {52852#(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; {52853#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:27,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {52853#(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; {52854#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:27,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {52854#(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; {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:27,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:27,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {52856#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:27,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {52856#(and (<= main_~z~0 12) (<= 12 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; {52857#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:27,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {52857#(and (<= main_~z~0 11) (<= 11 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; {52858#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:27,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {52858#(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; {52859#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:27,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {52859#(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; {52860#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:27,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {52860#(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; {52861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:27,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {52861#(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; {52862#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:27,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {52862#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {52839#false} is VALID [2022-04-08 10:06:27,541 INFO L272 TraceCheckUtils]: 27: Hoare triple {52839#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52839#false} is VALID [2022-04-08 10:06:27,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {52839#false} ~cond := #in~cond; {52839#false} is VALID [2022-04-08 10:06:27,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {52839#false} assume 0 == ~cond; {52839#false} is VALID [2022-04-08 10:06:27,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {52839#false} assume !false; {52839#false} is VALID [2022-04-08 10:06:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:27,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:27,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259059996] [2022-04-08 10:06:27,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259059996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:27,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000852217] [2022-04-08 10:06:27,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:27,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:27,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:27,543 INFO L229 MonitoredProcess]: Starting monitored process 102 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:06:27,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-04-08 10:06:27,681 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:06:27,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:27,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:06:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:27,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {52838#true} call ULTIMATE.init(); {52838#true} is VALID [2022-04-08 10:06:27,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {52838#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); {52838#true} is VALID [2022-04-08 10:06:27,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-08 10:06:27,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-08 10:06:27,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {52838#true} call #t~ret9 := main(); {52838#true} is VALID [2022-04-08 10:06:27,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {52838#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52843#(= main_~y~0 0)} is VALID [2022-04-08 10:06:27,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {52843#(= 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; {52844#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:27,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {52844#(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; {52845#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:27,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {52845#(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; {52846#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:27,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {52846#(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; {52847#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:27,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {52847#(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; {52848#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:27,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {52848#(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; {52849#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {52849#(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; {52850#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:27,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {52850#(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; {52851#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:27,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {52851#(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; {52852#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:27,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {52852#(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; {52853#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:27,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {52853#(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; {52854#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:27,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {52854#(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; {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:27,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:27,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {52855#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {52856#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:27,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {52856#(and (<= main_~z~0 12) (<= 12 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; {52857#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:27,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {52857#(and (<= main_~z~0 11) (<= 11 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; {52858#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:27,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {52858#(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; {52859#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:27,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {52859#(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; {52860#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:27,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {52860#(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; {52861#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:27,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {52861#(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; {52942#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:27,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {52942#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {52839#false} is VALID [2022-04-08 10:06:27,940 INFO L272 TraceCheckUtils]: 27: Hoare triple {52839#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52839#false} is VALID [2022-04-08 10:06:27,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {52839#false} ~cond := #in~cond; {52839#false} is VALID [2022-04-08 10:06:27,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {52839#false} assume 0 == ~cond; {52839#false} is VALID [2022-04-08 10:06:27,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {52839#false} assume !false; {52839#false} is VALID [2022-04-08 10:06:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:27,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:28,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {52839#false} assume !false; {52839#false} is VALID [2022-04-08 10:06:28,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {52839#false} assume 0 == ~cond; {52839#false} is VALID [2022-04-08 10:06:28,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {52839#false} ~cond := #in~cond; {52839#false} is VALID [2022-04-08 10:06:28,513 INFO L272 TraceCheckUtils]: 27: Hoare triple {52839#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52839#false} is VALID [2022-04-08 10:06:28,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {52970#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {52839#false} is VALID [2022-04-08 10:06:28,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {52974#(< 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; {52970#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:28,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {52978#(< 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; {52974#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:28,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {52982#(< 0 (mod (+ main_~z~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; {52978#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:28,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {52986#(< 0 (mod (+ 4294967292 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; {52982#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:28,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {52990#(< 0 (mod (+ 4294967291 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; {52986#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:28,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {52994#(< 0 (mod (+ 4294967290 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; {52990#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:28,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {52998#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {52994#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:28,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {52998#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {52998#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {53005#(< 0 (mod (+ 4294967291 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; {52998#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {53009#(< 0 (mod (+ 4294967292 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; {53005#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {53013#(< 0 (mod (+ main_~y~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; {53009#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {53017#(< 0 (mod (+ main_~y~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; {53013#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:28,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {53021#(< 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; {53017#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:28,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {53025#(< 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; {53021#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:28,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {53029#(< 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; {53025#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:28,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {53033#(< 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; {53029#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:28,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {53037#(< 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; {53033#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:28,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {53041#(< 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; {53037#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:28,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {53045#(< 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; {53041#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:28,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {53049#(< 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; {53045#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {52838#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53049#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:28,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {52838#true} call #t~ret9 := main(); {52838#true} is VALID [2022-04-08 10:06:28,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52838#true} {52838#true} #50#return; {52838#true} is VALID [2022-04-08 10:06:28,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {52838#true} assume true; {52838#true} is VALID [2022-04-08 10:06:28,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {52838#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); {52838#true} is VALID [2022-04-08 10:06:28,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {52838#true} call ULTIMATE.init(); {52838#true} is VALID [2022-04-08 10:06:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:28,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000852217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:28,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:28,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:28,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:28,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2004779971] [2022-04-08 10:06:28,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2004779971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:28,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:28,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195560245] [2022-04-08 10:06:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:28,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:28,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:28,544 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:06:28,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:28,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:28,545 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,198 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2022-04-08 10:06:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:06:32,198 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 75 transitions. [2022-04-08 10:06:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 75 transitions. [2022-04-08 10:06:32,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 75 transitions. [2022-04-08 10:06:32,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:32,250 INFO L225 Difference]: With dead ends: 93 [2022-04-08 10:06:32,250 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 10:06:32,251 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1126, Invalid=5036, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 10:06:32,251 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:32,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 100 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:06:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 10:06:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 51. [2022-04-08 10:06:32,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:32,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,638 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,638 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,639 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-08 10:06:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-08 10:06:32,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:32,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:32,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 88 states. [2022-04-08 10:06:32,639 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 88 states. [2022-04-08 10:06:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,640 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-08 10:06:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-08 10:06:32,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:32,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:32,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:32,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:32,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:32,640 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:32,641 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:32,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:32,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:06:33,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:06:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:33,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:33,664 INFO L499 BasicCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:33,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-04-08 10:06:33,868 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-04-08 10:06:33,868 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:33,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 578745942, now seen corresponding path program 169 times [2022-04-08 10:06:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:33,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2571715] [2022-04-08 10:06:33,872 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:33,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:33,872 INFO L85 PathProgramCache]: Analyzing trace with hash 578745942, now seen corresponding path program 170 times [2022-04-08 10:06:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:33,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621484953] [2022-04-08 10:06:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:34,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {53629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {53604#true} is VALID [2022-04-08 10:06:34,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-08 10:06:34,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-08 10:06:34,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {53604#true} call ULTIMATE.init(); {53629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:34,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {53629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {53604#true} is VALID [2022-04-08 10:06:34,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-08 10:06:34,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-08 10:06:34,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {53604#true} call #t~ret9 := main(); {53604#true} is VALID [2022-04-08 10:06:34,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {53604#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53609#(= main_~y~0 0)} is VALID [2022-04-08 10:06:34,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {53609#(= 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; {53610#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {53610#(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; {53611#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:34,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {53611#(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; {53612#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:34,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {53612#(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; {53613#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:34,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {53613#(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; {53614#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:34,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {53614#(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; {53615#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:34,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {53615#(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; {53616#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:34,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {53616#(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; {53617#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:34,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {53617#(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; {53618#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:34,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {53618#(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; {53619#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:34,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {53619#(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; {53620#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:34,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {53620#(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; {53621#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:34,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {53621#(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; {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:34,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:34,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {53623#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:06:34,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {53623#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53624#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:34,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {53624#(and (<= main_~z~0 12) (<= 12 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; {53625#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:34,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {53625#(and (<= main_~z~0 11) (<= 11 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; {53626#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:34,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {53626#(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; {53627#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:34,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {53627#(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; {53628#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:34,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {53628#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {53605#false} is VALID [2022-04-08 10:06:34,211 INFO L272 TraceCheckUtils]: 27: Hoare triple {53605#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53605#false} is VALID [2022-04-08 10:06:34,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {53605#false} ~cond := #in~cond; {53605#false} is VALID [2022-04-08 10:06:34,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {53605#false} assume 0 == ~cond; {53605#false} is VALID [2022-04-08 10:06:34,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-04-08 10:06:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621484953] [2022-04-08 10:06:34,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621484953] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:34,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760468693] [2022-04-08 10:06:34,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:34,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:34,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:34,213 INFO L229 MonitoredProcess]: Starting monitored process 103 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:06:34,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-04-08 10:06:34,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:34,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:34,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:06:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:34,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:34,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {53604#true} call ULTIMATE.init(); {53604#true} is VALID [2022-04-08 10:06:34,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {53604#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); {53604#true} is VALID [2022-04-08 10:06:34,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-08 10:06:34,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-08 10:06:34,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {53604#true} call #t~ret9 := main(); {53604#true} is VALID [2022-04-08 10:06:34,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {53604#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53609#(= main_~y~0 0)} is VALID [2022-04-08 10:06:34,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {53609#(= 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; {53610#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:34,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {53610#(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; {53611#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:34,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {53611#(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; {53612#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:34,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {53612#(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; {53613#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:34,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {53613#(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; {53614#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:34,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {53614#(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; {53615#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:34,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {53615#(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; {53616#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:34,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {53616#(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; {53617#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:34,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {53617#(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; {53618#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:34,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {53618#(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; {53619#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:34,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {53619#(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; {53620#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:34,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {53620#(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; {53621#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:34,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {53621#(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; {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:34,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:34,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {53622#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {53623#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:06:34,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {53623#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53624#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:34,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {53624#(and (<= main_~z~0 12) (<= 12 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; {53625#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:34,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {53625#(and (<= main_~z~0 11) (<= 11 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; {53626#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:34,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {53626#(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; {53627#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:06:34,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {53627#(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; {53708#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:34,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {53708#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {53605#false} is VALID [2022-04-08 10:06:34,575 INFO L272 TraceCheckUtils]: 27: Hoare triple {53605#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53605#false} is VALID [2022-04-08 10:06:34,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {53605#false} ~cond := #in~cond; {53605#false} is VALID [2022-04-08 10:06:34,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {53605#false} assume 0 == ~cond; {53605#false} is VALID [2022-04-08 10:06:34,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-04-08 10:06:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:34,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:35,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {53605#false} assume !false; {53605#false} is VALID [2022-04-08 10:06:35,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {53605#false} assume 0 == ~cond; {53605#false} is VALID [2022-04-08 10:06:35,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {53605#false} ~cond := #in~cond; {53605#false} is VALID [2022-04-08 10:06:35,077 INFO L272 TraceCheckUtils]: 27: Hoare triple {53605#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53605#false} is VALID [2022-04-08 10:06:35,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {53736#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53605#false} is VALID [2022-04-08 10:06:35,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {53740#(< 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; {53736#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:35,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {53744#(< 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; {53740#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:35,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {53748#(< 0 (mod (+ main_~z~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; {53744#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:35,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {53752#(< 0 (mod (+ 4294967292 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; {53748#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:35,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {53756#(< 0 (mod (+ 4294967291 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; {53752#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:35,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {53760#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {53756#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:35,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {53760#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {53760#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:35,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {53767#(< 0 (mod (+ 4294967292 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; {53760#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:35,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {53771#(< 0 (mod (+ main_~y~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; {53767#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:35,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {53775#(< 0 (mod (+ main_~y~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; {53771#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:35,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {53779#(< 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; {53775#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:35,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {53783#(< 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; {53779#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:35,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {53787#(< 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; {53783#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:35,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {53791#(< 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; {53787#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:35,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {53795#(< 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; {53791#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:35,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {53799#(< 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; {53795#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:35,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {53803#(< 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; {53799#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:35,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {53807#(< 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; {53803#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:35,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {53811#(< 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; {53807#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:35,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {53815#(< 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; {53811#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:35,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {53604#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53815#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:35,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {53604#true} call #t~ret9 := main(); {53604#true} is VALID [2022-04-08 10:06:35,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53604#true} {53604#true} #50#return; {53604#true} is VALID [2022-04-08 10:06:35,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {53604#true} assume true; {53604#true} is VALID [2022-04-08 10:06:35,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {53604#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); {53604#true} is VALID [2022-04-08 10:06:35,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {53604#true} call ULTIMATE.init(); {53604#true} is VALID [2022-04-08 10:06:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:35,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760468693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:35,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:35,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:35,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:35,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2571715] [2022-04-08 10:06:35,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2571715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:35,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:35,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:35,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58354123] [2022-04-08 10:06:35,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:35,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:35,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:35,105 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:06:35,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1569, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:35,105 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:38,283 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-04-08 10:06:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:06:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-08 10:06:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2022-04-08 10:06:38,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 79 transitions. [2022-04-08 10:06:38,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:38,329 INFO L225 Difference]: With dead ends: 100 [2022-04-08 10:06:38,329 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 10:06:38,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1119, Invalid=4887, Unknown=0, NotChecked=0, Total=6006 [2022-04-08 10:06:38,329 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:38,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:06:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 10:06:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 51. [2022-04-08 10:06:38,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:38,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,755 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,755 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:38,783 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2022-04-08 10:06:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-04-08 10:06:38,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:38,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:38,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 95 states. [2022-04-08 10:06:38,784 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 95 states. [2022-04-08 10:06:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:38,785 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2022-04-08 10:06:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-04-08 10:06:38,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:38,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:38,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:38,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:38,786 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:38,786 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:38,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:38,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:06:39,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:39,804 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:06:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:39,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:39,804 INFO L499 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:39,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:40,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-04-08 10:06:40,019 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 502339191, now seen corresponding path program 171 times [2022-04-08 10:06:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:40,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394647114] [2022-04-08 10:06:40,021 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:40,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 502339191, now seen corresponding path program 172 times [2022-04-08 10:06:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:40,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741920394] [2022-04-08 10:06:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {54421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {54396#true} is VALID [2022-04-08 10:06:40,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-08 10:06:40,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-08 10:06:40,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {54396#true} call ULTIMATE.init(); {54421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:40,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {54421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {54396#true} is VALID [2022-04-08 10:06:40,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-08 10:06:40,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-08 10:06:40,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {54396#true} call #t~ret9 := main(); {54396#true} is VALID [2022-04-08 10:06:40,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {54396#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54401#(= main_~y~0 0)} is VALID [2022-04-08 10:06:40,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {54401#(= 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; {54402#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:40,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {54402#(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; {54403#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:40,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {54403#(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; {54404#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:40,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {54404#(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; {54405#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:40,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {54405#(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; {54406#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:40,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {54406#(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; {54407#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:40,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {54407#(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; {54408#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:40,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {54408#(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; {54409#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:40,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {54409#(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; {54410#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:40,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {54410#(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; {54411#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:40,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {54411#(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; {54412#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:40,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {54412#(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; {54413#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:40,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {54413#(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; {54414#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:40,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {54414#(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; {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:40,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:40,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {54416#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:06:40,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {54416#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54417#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:06:40,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {54417#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54418#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:40,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {54418#(and (<= main_~z~0 12) (<= 12 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; {54419#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:40,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {54419#(and (<= main_~z~0 11) (<= 11 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; {54420#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:40,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {54420#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {54397#false} is VALID [2022-04-08 10:06:40,412 INFO L272 TraceCheckUtils]: 27: Hoare triple {54397#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54397#false} is VALID [2022-04-08 10:06:40,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {54397#false} ~cond := #in~cond; {54397#false} is VALID [2022-04-08 10:06:40,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {54397#false} assume 0 == ~cond; {54397#false} is VALID [2022-04-08 10:06:40,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {54397#false} assume !false; {54397#false} is VALID [2022-04-08 10:06:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:40,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:40,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741920394] [2022-04-08 10:06:40,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741920394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:40,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661188524] [2022-04-08 10:06:40,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:40,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:40,415 INFO L229 MonitoredProcess]: Starting monitored process 104 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:06:40,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-04-08 10:06:40,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:40,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:40,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:06:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:40,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:40,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {54396#true} call ULTIMATE.init(); {54396#true} is VALID [2022-04-08 10:06:40,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {54396#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); {54396#true} is VALID [2022-04-08 10:06:40,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-08 10:06:40,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-08 10:06:40,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {54396#true} call #t~ret9 := main(); {54396#true} is VALID [2022-04-08 10:06:40,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {54396#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54401#(= main_~y~0 0)} is VALID [2022-04-08 10:06:40,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {54401#(= 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; {54402#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:40,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {54402#(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; {54403#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:40,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {54403#(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; {54404#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:40,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {54404#(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; {54405#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:40,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {54405#(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; {54406#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:40,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {54406#(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; {54407#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:40,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {54407#(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; {54408#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:40,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {54408#(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; {54409#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:40,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {54409#(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; {54410#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:40,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {54410#(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; {54411#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:40,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {54411#(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; {54412#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:40,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {54412#(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; {54413#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:40,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {54413#(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; {54414#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:40,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {54414#(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; {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:40,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:40,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {54415#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {54416#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:06:40,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {54416#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54417#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:06:40,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {54417#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54418#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:40,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {54418#(and (<= main_~z~0 12) (<= 12 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; {54419#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:06:40,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {54419#(and (<= main_~z~0 11) (<= 11 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; {54500#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:06:40,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {54500#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {54397#false} is VALID [2022-04-08 10:06:40,801 INFO L272 TraceCheckUtils]: 27: Hoare triple {54397#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54397#false} is VALID [2022-04-08 10:06:40,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {54397#false} ~cond := #in~cond; {54397#false} is VALID [2022-04-08 10:06:40,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {54397#false} assume 0 == ~cond; {54397#false} is VALID [2022-04-08 10:06:40,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {54397#false} assume !false; {54397#false} is VALID [2022-04-08 10:06:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:40,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:41,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {54397#false} assume !false; {54397#false} is VALID [2022-04-08 10:06:41,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {54397#false} assume 0 == ~cond; {54397#false} is VALID [2022-04-08 10:06:41,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {54397#false} ~cond := #in~cond; {54397#false} is VALID [2022-04-08 10:06:41,425 INFO L272 TraceCheckUtils]: 27: Hoare triple {54397#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54397#false} is VALID [2022-04-08 10:06:41,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {54528#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {54397#false} is VALID [2022-04-08 10:06:41,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {54532#(< 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; {54528#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:41,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {54536#(< 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; {54532#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:41,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {54540#(< 0 (mod (+ main_~z~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; {54536#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:41,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {54544#(< 0 (mod (+ 4294967292 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; {54540#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:41,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {54548#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {54544#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:06:41,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {54548#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54548#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {54555#(< 0 (mod (+ main_~y~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; {54548#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {54559#(< 0 (mod (+ main_~y~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; {54555#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:41,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {54563#(< 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; {54559#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:41,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {54567#(< 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; {54563#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:41,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {54571#(< 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; {54567#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:41,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {54575#(< 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; {54571#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:41,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {54579#(< 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; {54575#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:41,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {54583#(< 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; {54579#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:41,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {54587#(< 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; {54583#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:41,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {54591#(< 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; {54587#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {54595#(< 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; {54591#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:41,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {54599#(< 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; {54595#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:41,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {54603#(< 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; {54599#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:41,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {54607#(< 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; {54603#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:41,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {54396#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54607#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:41,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {54396#true} call #t~ret9 := main(); {54396#true} is VALID [2022-04-08 10:06:41,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54396#true} {54396#true} #50#return; {54396#true} is VALID [2022-04-08 10:06:41,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {54396#true} assume true; {54396#true} is VALID [2022-04-08 10:06:41,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {54396#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); {54396#true} is VALID [2022-04-08 10:06:41,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {54396#true} call ULTIMATE.init(); {54396#true} is VALID [2022-04-08 10:06:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:41,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661188524] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:41,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:41,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:41,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:41,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394647114] [2022-04-08 10:06:41,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394647114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:41,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:41,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052765431] [2022-04-08 10:06:41,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:41,437 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:41,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:41,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:41,450 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:06:41,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:41,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:41,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:41,450 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:44,734 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2022-04-08 10:06:44,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:06:44,734 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-08 10:06:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 80 transitions. [2022-04-08 10:06:44,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 80 transitions. [2022-04-08 10:06:44,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:44,779 INFO L225 Difference]: With dead ends: 106 [2022-04-08 10:06:44,779 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 10:06:44,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1030, Invalid=4372, Unknown=0, NotChecked=0, Total=5402 [2022-04-08 10:06:44,779 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:44,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:06:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 10:06:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 51. [2022-04-08 10:06:45,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:45,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,188 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,188 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:45,189 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-08 10:06:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-04-08 10:06:45,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:45,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:45,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 101 states. [2022-04-08 10:06:45,190 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 101 states. [2022-04-08 10:06:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:45,190 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-04-08 10:06:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-04-08 10:06:45,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:45,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:45,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:45,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:45,196 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:45,196 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:45,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:45,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:06:46,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:06:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:46,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:46,190 INFO L499 BasicCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:46,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:46,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:46,403 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1469705782, now seen corresponding path program 173 times [2022-04-08 10:06:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:46,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [484469570] [2022-04-08 10:06:46,405 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:46,405 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1469705782, now seen corresponding path program 174 times [2022-04-08 10:06:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:46,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904160784] [2022-04-08 10:06:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:46,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {55229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {55204#true} is VALID [2022-04-08 10:06:46,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-08 10:06:46,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-08 10:06:46,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {55204#true} call ULTIMATE.init(); {55229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:46,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {55229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {55204#true} is VALID [2022-04-08 10:06:46,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-08 10:06:46,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-08 10:06:46,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {55204#true} call #t~ret9 := main(); {55204#true} is VALID [2022-04-08 10:06:46,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {55204#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55209#(= main_~y~0 0)} is VALID [2022-04-08 10:06:46,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {55209#(= 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; {55210#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:46,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {55210#(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; {55211#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:46,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {55211#(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; {55212#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:46,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {55212#(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; {55213#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:46,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {55213#(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; {55214#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {55214#(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; {55215#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {55215#(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; {55216#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:46,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {55216#(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; {55217#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:46,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {55217#(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; {55218#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:46,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {55218#(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; {55219#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:46,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {55219#(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; {55220#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:46,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {55220#(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; {55221#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:46,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {55221#(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; {55222#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:46,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {55222#(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; {55223#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:46,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {55223#(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; {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:46,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:46,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {55225#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:06:46,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {55225#(and (<= main_~z~0 15) (<= 15 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; {55226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:06:46,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {55226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:06:46,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {55227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55228#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:46,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {55228#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {55205#false} is VALID [2022-04-08 10:06:46,654 INFO L272 TraceCheckUtils]: 27: Hoare triple {55205#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55205#false} is VALID [2022-04-08 10:06:46,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {55205#false} ~cond := #in~cond; {55205#false} is VALID [2022-04-08 10:06:46,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {55205#false} assume 0 == ~cond; {55205#false} is VALID [2022-04-08 10:06:46,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {55205#false} assume !false; {55205#false} is VALID [2022-04-08 10:06:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:46,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904160784] [2022-04-08 10:06:46,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904160784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:46,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752548744] [2022-04-08 10:06:46,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:46,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:46,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:46,656 INFO L229 MonitoredProcess]: Starting monitored process 105 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:06:46,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-04-08 10:06:47,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:06:47,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:47,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 10:06:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:47,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:47,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {55204#true} call ULTIMATE.init(); {55204#true} is VALID [2022-04-08 10:06:47,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {55204#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); {55204#true} is VALID [2022-04-08 10:06:47,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-08 10:06:47,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-08 10:06:47,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {55204#true} call #t~ret9 := main(); {55204#true} is VALID [2022-04-08 10:06:47,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {55204#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55209#(= main_~y~0 0)} is VALID [2022-04-08 10:06:47,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {55209#(= 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; {55210#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:47,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {55210#(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; {55211#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:47,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {55211#(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; {55212#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:47,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {55212#(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; {55213#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:47,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {55213#(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; {55214#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {55214#(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; {55215#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:47,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {55215#(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; {55216#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:47,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {55216#(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; {55217#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:47,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {55217#(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; {55218#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:47,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {55218#(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; {55219#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:47,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {55219#(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; {55220#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:47,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {55220#(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; {55221#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:47,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {55221#(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; {55222#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:47,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {55222#(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; {55223#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:47,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {55223#(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; {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:47,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:47,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {55224#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {55225#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:06:47,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {55225#(and (<= main_~z~0 15) (<= 15 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; {55226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:06:47,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {55226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:06:47,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {55227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55308#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:06:47,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {55308#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {55205#false} is VALID [2022-04-08 10:06:47,339 INFO L272 TraceCheckUtils]: 27: Hoare triple {55205#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55205#false} is VALID [2022-04-08 10:06:47,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {55205#false} ~cond := #in~cond; {55205#false} is VALID [2022-04-08 10:06:47,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {55205#false} assume 0 == ~cond; {55205#false} is VALID [2022-04-08 10:06:47,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {55205#false} assume !false; {55205#false} is VALID [2022-04-08 10:06:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:47,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:48,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {55205#false} assume !false; {55205#false} is VALID [2022-04-08 10:06:48,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {55205#false} assume 0 == ~cond; {55205#false} is VALID [2022-04-08 10:06:48,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {55205#false} ~cond := #in~cond; {55205#false} is VALID [2022-04-08 10:06:48,069 INFO L272 TraceCheckUtils]: 27: Hoare triple {55205#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55205#false} is VALID [2022-04-08 10:06:48,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {55336#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {55205#false} is VALID [2022-04-08 10:06:48,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {55340#(< 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; {55336#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:48,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {55344#(< 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; {55340#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:48,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {55348#(< 0 (mod (+ main_~z~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; {55344#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:48,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {55352#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {55348#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:48,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {55352#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {55352#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:48,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {55359#(< 0 (mod (+ main_~y~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; {55352#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:48,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {55363#(< 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; {55359#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:48,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {55367#(< 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; {55363#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:48,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {55371#(< 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; {55367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:48,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {55375#(< 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; {55371#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:48,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {55379#(< 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; {55375#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:48,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {55383#(< 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; {55379#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:48,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {55387#(< 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; {55383#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:48,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {55391#(< 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; {55387#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:48,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {55395#(< 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; {55391#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:48,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {55399#(< 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; {55395#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:48,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {55403#(< 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; {55399#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:48,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {55407#(< 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; {55403#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:48,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {55411#(< 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; {55407#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:48,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {55415#(< 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; {55411#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:06:48,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {55204#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55415#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:06:48,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {55204#true} call #t~ret9 := main(); {55204#true} is VALID [2022-04-08 10:06:48,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55204#true} {55204#true} #50#return; {55204#true} is VALID [2022-04-08 10:06:48,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {55204#true} assume true; {55204#true} is VALID [2022-04-08 10:06:48,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {55204#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); {55204#true} is VALID [2022-04-08 10:06:48,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {55204#true} call ULTIMATE.init(); {55204#true} is VALID [2022-04-08 10:06:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:48,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752548744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:48,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:48,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:48,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:48,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [484469570] [2022-04-08 10:06:48,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [484469570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:48,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:48,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:48,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565750302] [2022-04-08 10:06:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:48,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:48,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:48,103 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:06:48,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:48,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1531, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:48,104 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:52,232 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2022-04-08 10:06:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:06:52,232 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2022-04-08 10:06:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 81 transitions. [2022-04-08 10:06:52,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 81 transitions. [2022-04-08 10:06:52,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:52,277 INFO L225 Difference]: With dead ends: 111 [2022-04-08 10:06:52,277 INFO L226 Difference]: Without dead ends: 106 [2022-04-08 10:06:52,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=949, Invalid=3881, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:06:52,277 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:52,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 122 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:06:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-08 10:06:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 51. [2022-04-08 10:06:52,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:52,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:52,680 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:52,680 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:52,681 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-04-08 10:06:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-04-08 10:06:52,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:52,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:52,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 106 states. [2022-04-08 10:06:52,681 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 106 states. [2022-04-08 10:06:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:52,682 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-04-08 10:06:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-04-08 10:06:52,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:52,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:52,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:52,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:52,683 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:52,683 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:52,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:52,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:06:53,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:06:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:06:53,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:53,629 INFO L499 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:53,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:53,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:53,833 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 531079831, now seen corresponding path program 175 times [2022-04-08 10:06:53,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:53,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1029897313] [2022-04-08 10:06:53,835 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:53,835 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 531079831, now seen corresponding path program 176 times [2022-04-08 10:06:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:53,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131986450] [2022-04-08 10:06:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:54,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {56049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {56024#true} is VALID [2022-04-08 10:06:54,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-08 10:06:54,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-08 10:06:54,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {56024#true} call ULTIMATE.init(); {56049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:54,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {56049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {56024#true} is VALID [2022-04-08 10:06:54,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-08 10:06:54,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-08 10:06:54,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {56024#true} call #t~ret9 := main(); {56024#true} is VALID [2022-04-08 10:06:54,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {56024#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56029#(= main_~y~0 0)} is VALID [2022-04-08 10:06:54,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {56029#(= 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; {56030#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:54,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {56030#(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; {56031#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:54,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {56031#(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; {56032#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:54,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {56032#(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; {56033#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:54,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {56033#(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; {56034#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:54,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {56034#(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; {56035#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:54,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {56035#(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; {56036#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:54,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {56036#(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; {56037#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:54,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {56037#(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; {56038#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:54,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {56038#(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; {56039#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:54,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {56039#(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; {56040#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:54,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {56040#(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; {56041#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:54,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {56041#(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; {56042#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:54,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {56042#(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; {56043#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:54,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {56043#(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; {56044#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:54,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {56044#(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; {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:54,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:54,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {56046#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:06:54,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {56046#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56047#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:06:54,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {56047#(and (<= main_~z~0 15) (<= 15 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; {56048#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:54,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {56048#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {56025#false} is VALID [2022-04-08 10:06:54,120 INFO L272 TraceCheckUtils]: 27: Hoare triple {56025#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56025#false} is VALID [2022-04-08 10:06:54,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {56025#false} ~cond := #in~cond; {56025#false} is VALID [2022-04-08 10:06:54,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {56025#false} assume 0 == ~cond; {56025#false} is VALID [2022-04-08 10:06:54,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {56025#false} assume !false; {56025#false} is VALID [2022-04-08 10:06:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:54,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131986450] [2022-04-08 10:06:54,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131986450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:54,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012052300] [2022-04-08 10:06:54,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:54,121 INFO L229 MonitoredProcess]: Starting monitored process 106 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:06:54,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-04-08 10:06:54,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:54,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:54,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:06:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:54,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:54,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {56024#true} call ULTIMATE.init(); {56024#true} is VALID [2022-04-08 10:06:54,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {56024#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); {56024#true} is VALID [2022-04-08 10:06:54,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-08 10:06:54,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-08 10:06:54,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {56024#true} call #t~ret9 := main(); {56024#true} is VALID [2022-04-08 10:06:54,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {56024#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56029#(= main_~y~0 0)} is VALID [2022-04-08 10:06:54,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {56029#(= 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; {56030#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:54,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {56030#(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; {56031#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:54,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {56031#(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; {56032#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:54,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {56032#(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; {56033#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:54,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {56033#(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; {56034#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:54,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {56034#(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; {56035#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:54,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {56035#(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; {56036#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:54,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {56036#(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; {56037#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:54,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {56037#(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; {56038#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:54,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {56038#(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; {56039#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:54,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {56039#(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; {56040#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:54,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {56040#(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; {56041#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:54,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {56041#(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; {56042#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:54,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {56042#(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; {56043#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:54,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {56043#(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; {56044#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:54,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {56044#(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; {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:54,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:54,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {56045#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {56046#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:06:54,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {56046#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56047#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:06:54,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {56047#(and (<= main_~z~0 15) (<= 15 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; {56128#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:06:54,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {56128#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {56025#false} is VALID [2022-04-08 10:06:54,552 INFO L272 TraceCheckUtils]: 27: Hoare triple {56025#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56025#false} is VALID [2022-04-08 10:06:54,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {56025#false} ~cond := #in~cond; {56025#false} is VALID [2022-04-08 10:06:54,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {56025#false} assume 0 == ~cond; {56025#false} is VALID [2022-04-08 10:06:54,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {56025#false} assume !false; {56025#false} is VALID [2022-04-08 10:06:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:54,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:55,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {56025#false} assume !false; {56025#false} is VALID [2022-04-08 10:06:55,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {56025#false} assume 0 == ~cond; {56025#false} is VALID [2022-04-08 10:06:55,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {56025#false} ~cond := #in~cond; {56025#false} is VALID [2022-04-08 10:06:55,219 INFO L272 TraceCheckUtils]: 27: Hoare triple {56025#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56025#false} is VALID [2022-04-08 10:06:55,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {56156#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56025#false} is VALID [2022-04-08 10:06:55,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {56160#(< 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; {56156#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:55,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {56164#(< 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; {56160#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:55,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {56168#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {56164#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:55,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {56168#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {56168#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:55,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {56175#(< 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; {56168#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:55,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {56179#(< 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; {56175#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:55,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {56183#(< 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; {56179#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:55,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {56187#(< 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; {56183#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:55,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {56191#(< 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; {56187#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:55,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {56195#(< 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; {56191#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:55,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {56199#(< 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; {56195#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:55,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {56203#(< 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; {56199#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:55,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {56207#(< 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; {56203#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:55,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {56211#(< 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; {56207#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:55,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {56215#(< 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; {56211#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:55,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {56219#(< 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; {56215#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:55,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {56223#(< 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; {56219#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:55,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {56227#(< 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; {56223#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:06:55,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {56231#(< 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; {56227#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:06:55,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {56235#(< 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; {56231#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:06:55,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {56024#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56235#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:06:55,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {56024#true} call #t~ret9 := main(); {56024#true} is VALID [2022-04-08 10:06:55,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56024#true} {56024#true} #50#return; {56024#true} is VALID [2022-04-08 10:06:55,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {56024#true} assume true; {56024#true} is VALID [2022-04-08 10:06:55,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {56024#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); {56024#true} is VALID [2022-04-08 10:06:55,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {56024#true} call ULTIMATE.init(); {56024#true} is VALID [2022-04-08 10:06:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:55,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012052300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:55,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:55,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:55,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:55,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1029897313] [2022-04-08 10:06:55,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1029897313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:55,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:55,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181617811] [2022-04-08 10:06:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:55,233 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:55,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:55,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:55,253 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:06:55,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1506, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:55,254 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:59,206 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2022-04-08 10:06:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:06:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-08 10:06:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-08 10:06:59,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 83 transitions. [2022-04-08 10:06:59,251 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:06:59,252 INFO L225 Difference]: With dead ends: 115 [2022-04-08 10:06:59,252 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 10:06:59,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=902, Invalid=3520, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:06:59,253 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 63 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:59,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 142 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:06:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 10:06:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 51. [2022-04-08 10:06:59,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:59,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,649 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,649 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:59,650 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-08 10:06:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-08 10:06:59,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:59,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:59,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 110 states. [2022-04-08 10:06:59,650 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 110 states. [2022-04-08 10:06:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:59,651 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-08 10:06:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-08 10:06:59,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:59,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:59,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:59,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:06:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:06:59,652 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:06:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:59,652 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:06:59,652 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:06:59,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:07:00,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:07:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:07:00,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:00,638 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:00,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:00,844 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-04-08 10:07:00,844 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash -53387754, now seen corresponding path program 177 times [2022-04-08 10:07:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:00,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1364750165] [2022-04-08 10:07:00,847 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:00,847 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash -53387754, now seen corresponding path program 178 times [2022-04-08 10:07:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:00,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925936020] [2022-04-08 10:07:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:01,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:01,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {56879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {56854#true} is VALID [2022-04-08 10:07:01,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-08 10:07:01,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-08 10:07:01,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {56854#true} call ULTIMATE.init(); {56879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:01,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {56879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {56854#true} is VALID [2022-04-08 10:07:01,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-08 10:07:01,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-08 10:07:01,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {56854#true} call #t~ret9 := main(); {56854#true} is VALID [2022-04-08 10:07:01,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {56854#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56859#(= main_~y~0 0)} is VALID [2022-04-08 10:07:01,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {56859#(= 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; {56860#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:01,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {56860#(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; {56861#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:01,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {56861#(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; {56862#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:01,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {56862#(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; {56863#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:01,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {56863#(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; {56864#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:01,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {56864#(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; {56865#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:01,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {56865#(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; {56866#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:01,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {56866#(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; {56867#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:01,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {56867#(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; {56868#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:01,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {56868#(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; {56869#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:01,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {56869#(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; {56870#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:01,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {56870#(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; {56871#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:01,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {56871#(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; {56872#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:01,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {56872#(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; {56873#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:01,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {56873#(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; {56874#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:01,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {56874#(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; {56875#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:01,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {56875#(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; {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:01,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:01,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {56877#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:07:01,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {56877#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56878#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:01,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {56878#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {56855#false} is VALID [2022-04-08 10:07:01,214 INFO L272 TraceCheckUtils]: 27: Hoare triple {56855#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56855#false} is VALID [2022-04-08 10:07:01,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {56855#false} ~cond := #in~cond; {56855#false} is VALID [2022-04-08 10:07:01,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {56855#false} assume 0 == ~cond; {56855#false} is VALID [2022-04-08 10:07:01,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {56855#false} assume !false; {56855#false} is VALID [2022-04-08 10:07:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925936020] [2022-04-08 10:07:01,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925936020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142307891] [2022-04-08 10:07:01,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:01,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:01,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:01,215 INFO L229 MonitoredProcess]: Starting monitored process 107 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:01,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-04-08 10:07:01,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:01,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:01,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:07:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:01,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:01,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {56854#true} call ULTIMATE.init(); {56854#true} is VALID [2022-04-08 10:07:01,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {56854#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); {56854#true} is VALID [2022-04-08 10:07:01,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-08 10:07:01,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-08 10:07:01,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {56854#true} call #t~ret9 := main(); {56854#true} is VALID [2022-04-08 10:07:01,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {56854#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56859#(= main_~y~0 0)} is VALID [2022-04-08 10:07:01,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {56859#(= 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; {56860#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:01,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {56860#(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; {56861#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:01,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {56861#(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; {56862#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:01,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {56862#(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; {56863#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:01,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {56863#(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; {56864#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:01,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {56864#(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; {56865#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:01,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {56865#(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; {56866#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:01,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {56866#(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; {56867#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:01,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {56867#(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; {56868#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:01,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {56868#(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; {56869#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:01,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {56869#(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; {56870#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:01,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {56870#(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; {56871#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:01,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {56871#(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; {56872#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:01,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {56872#(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; {56873#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:01,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {56873#(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; {56874#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:01,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {56874#(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; {56875#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:01,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {56875#(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; {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:01,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:01,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {56876#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {56877#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:07:01,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {56877#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {56958#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:07:01,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {56958#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {56855#false} is VALID [2022-04-08 10:07:01,592 INFO L272 TraceCheckUtils]: 27: Hoare triple {56855#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56855#false} is VALID [2022-04-08 10:07:01,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {56855#false} ~cond := #in~cond; {56855#false} is VALID [2022-04-08 10:07:01,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {56855#false} assume 0 == ~cond; {56855#false} is VALID [2022-04-08 10:07:01,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {56855#false} assume !false; {56855#false} is VALID [2022-04-08 10:07:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:01,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:02,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {56855#false} assume !false; {56855#false} is VALID [2022-04-08 10:07:02,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {56855#false} assume 0 == ~cond; {56855#false} is VALID [2022-04-08 10:07:02,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {56855#false} ~cond := #in~cond; {56855#false} is VALID [2022-04-08 10:07:02,368 INFO L272 TraceCheckUtils]: 27: Hoare triple {56855#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56855#false} is VALID [2022-04-08 10:07:02,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {56986#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56855#false} is VALID [2022-04-08 10:07:02,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {56990#(< 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; {56986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:02,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {56994#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {56990#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:02,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {56994#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {56994#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:02,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {57001#(< 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; {56994#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:02,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {57005#(< 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; {57001#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:02,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {57009#(< 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; {57005#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:02,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {57013#(< 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; {57009#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:02,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {57017#(< 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; {57013#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:02,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {57021#(< 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; {57017#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:02,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {57025#(< 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; {57021#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:02,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {57029#(< 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; {57025#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:02,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {57033#(< 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; {57029#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:02,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {57037#(< 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; {57033#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:02,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {57041#(< 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; {57037#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:02,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {57045#(< 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; {57041#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:02,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {57049#(< 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; {57045#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:02,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {57053#(< 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; {57049#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:07:02,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {57057#(< 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; {57053#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:07:02,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {57061#(< 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; {57057#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:07:02,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {57065#(< 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; {57061#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:07:02,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {56854#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57065#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:07:02,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {56854#true} call #t~ret9 := main(); {56854#true} is VALID [2022-04-08 10:07:02,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56854#true} {56854#true} #50#return; {56854#true} is VALID [2022-04-08 10:07:02,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {56854#true} assume true; {56854#true} is VALID [2022-04-08 10:07:02,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {56854#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); {56854#true} is VALID [2022-04-08 10:07:02,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {56854#true} call ULTIMATE.init(); {56854#true} is VALID [2022-04-08 10:07:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:02,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142307891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:02,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:02,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:07:02,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:02,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1364750165] [2022-04-08 10:07:02,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1364750165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:02,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:02,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:07:02,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294832749] [2022-04-08 10:07:02,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:02,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:02,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:02,399 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:07:02,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:07:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:07:02,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1477, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:07:02,400 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:06,387 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-08 10:07:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:07:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2022-04-08 10:07:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 86 transitions. [2022-04-08 10:07:06,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 86 transitions. [2022-04-08 10:07:06,432 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:06,433 INFO L225 Difference]: With dead ends: 118 [2022-04-08 10:07:06,433 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 10:07:06,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=889, Invalid=3271, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 10:07:06,434 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:06,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 142 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:07:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 10:07:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2022-04-08 10:07:06,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:06,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:06,836 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:06,836 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:06,837 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-08 10:07:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-08 10:07:06,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:06,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:06,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 113 states. [2022-04-08 10:07:06,838 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 113 states. [2022-04-08 10:07:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:06,839 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-08 10:07:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-08 10:07:06,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:06,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:06,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:06,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:07:06,839 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 31 [2022-04-08 10:07:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:06,839 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:07:06,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:06,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:07:07,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:07:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:07:07,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:07,950 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:07,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2022-04-08 10:07:08,154 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-04-08 10:07:08,154 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:08,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2144515767, now seen corresponding path program 35 times [2022-04-08 10:07:08,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:08,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285383450] [2022-04-08 10:07:08,157 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:08,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2144515767, now seen corresponding path program 36 times [2022-04-08 10:07:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:08,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601006814] [2022-04-08 10:07:08,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:08,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {57717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {57692#true} is VALID [2022-04-08 10:07:08,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-08 10:07:08,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-08 10:07:08,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {57692#true} call ULTIMATE.init(); {57717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:08,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {57717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {57692#true} is VALID [2022-04-08 10:07:08,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-08 10:07:08,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-08 10:07:08,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {57692#true} call #t~ret9 := main(); {57692#true} is VALID [2022-04-08 10:07:08,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {57692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57697#(= main_~y~0 0)} is VALID [2022-04-08 10:07:08,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {57697#(= 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; {57698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:08,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {57698#(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; {57699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:08,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {57699#(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; {57700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:08,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {57700#(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; {57701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:08,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {57701#(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; {57702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:08,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {57702#(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; {57703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:08,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {57703#(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; {57704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:08,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {57704#(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; {57705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:08,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {57705#(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; {57706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:08,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {57706#(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; {57707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:08,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {57707#(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; {57708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:08,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {57708#(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; {57709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:08,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {57709#(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; {57710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:08,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {57710#(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; {57711#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:08,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {57711#(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; {57712#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:08,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {57712#(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; {57713#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {57713#(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; {57714#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {57714#(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; {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:08,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:08,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {57716#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-08 10:07:08,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {57716#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57693#false} is VALID [2022-04-08 10:07:08,512 INFO L272 TraceCheckUtils]: 27: Hoare triple {57693#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57693#false} is VALID [2022-04-08 10:07:08,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#false} ~cond := #in~cond; {57693#false} is VALID [2022-04-08 10:07:08,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#false} assume 0 == ~cond; {57693#false} is VALID [2022-04-08 10:07:08,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {57693#false} assume !false; {57693#false} is VALID [2022-04-08 10:07:08,513 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:07:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:08,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601006814] [2022-04-08 10:07:08,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601006814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:08,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859644639] [2022-04-08 10:07:08,513 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:08,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:08,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:08,514 INFO L229 MonitoredProcess]: Starting monitored process 108 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:08,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-04-08 10:07:08,804 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:07:08,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:08,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 10:07:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:08,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:09,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {57692#true} call ULTIMATE.init(); {57692#true} is VALID [2022-04-08 10:07:09,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {57692#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); {57692#true} is VALID [2022-04-08 10:07:09,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-08 10:07:09,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-08 10:07:09,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {57692#true} call #t~ret9 := main(); {57692#true} is VALID [2022-04-08 10:07:09,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {57692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57697#(= main_~y~0 0)} is VALID [2022-04-08 10:07:09,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {57697#(= 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; {57698#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:09,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {57698#(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; {57699#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:09,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {57699#(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; {57700#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:09,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {57700#(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; {57701#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:09,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {57701#(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; {57702#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:09,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {57702#(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; {57703#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:09,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {57703#(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; {57704#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:09,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {57704#(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; {57705#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:09,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {57705#(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; {57706#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:09,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {57706#(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; {57707#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:09,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {57707#(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; {57708#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:09,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {57708#(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; {57709#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:09,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {57709#(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; {57710#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:09,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {57710#(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; {57711#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:09,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {57711#(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; {57712#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:09,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {57712#(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; {57713#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:09,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {57713#(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; {57714#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:09,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {57714#(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; {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:09,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:09,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {57715#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {57796#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:07:09,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {57796#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {57693#false} is VALID [2022-04-08 10:07:09,255 INFO L272 TraceCheckUtils]: 27: Hoare triple {57693#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57693#false} is VALID [2022-04-08 10:07:09,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#false} ~cond := #in~cond; {57693#false} is VALID [2022-04-08 10:07:09,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#false} assume 0 == ~cond; {57693#false} is VALID [2022-04-08 10:07:09,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {57693#false} assume !false; {57693#false} is VALID [2022-04-08 10:07:09,255 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:07:09,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:10,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {57693#false} assume !false; {57693#false} is VALID [2022-04-08 10:07:10,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#false} assume 0 == ~cond; {57693#false} is VALID [2022-04-08 10:07:10,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#false} ~cond := #in~cond; {57693#false} is VALID [2022-04-08 10:07:10,143 INFO L272 TraceCheckUtils]: 27: Hoare triple {57693#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57693#false} is VALID [2022-04-08 10:07:10,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {57824#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {57693#false} is VALID [2022-04-08 10:07:10,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {57828#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {57824#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:10,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {57828#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {57828#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:10,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {57835#(< 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; {57828#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:10,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {57839#(< 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; {57835#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:10,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {57843#(< 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; {57839#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:10,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {57847#(< 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; {57843#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:10,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {57851#(< 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; {57847#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:10,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {57855#(< 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; {57851#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:10,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {57859#(< 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; {57855#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:10,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {57863#(< 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; {57859#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:10,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {57867#(< 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; {57863#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:10,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {57871#(< 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; {57867#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:10,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {57875#(< 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; {57871#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:10,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {57879#(< 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; {57875#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:10,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {57883#(< 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; {57879#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:07:10,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {57887#(< 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; {57883#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:07:10,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {57891#(< 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; {57887#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:07:10,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {57895#(< 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; {57891#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:07:10,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {57899#(< 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; {57895#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:07:10,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {57903#(< 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; {57899#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:07:10,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {57692#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57903#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:07:10,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {57692#true} call #t~ret9 := main(); {57692#true} is VALID [2022-04-08 10:07:10,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57692#true} {57692#true} #50#return; {57692#true} is VALID [2022-04-08 10:07:10,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {57692#true} assume true; {57692#true} is VALID [2022-04-08 10:07:10,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {57692#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); {57692#true} is VALID [2022-04-08 10:07:10,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {57692#true} call ULTIMATE.init(); {57692#true} is VALID [2022-04-08 10:07:10,155 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:07:10,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859644639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:10,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:10,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:07:10,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:10,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285383450] [2022-04-08 10:07:10,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285383450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:10,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:10,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:07:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573835028] [2022-04-08 10:07:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:10,156 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:10,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:10,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:10,170 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:07:10,170 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:07:10,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:07:10,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:07:10,171 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:14,502 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2022-04-08 10:07:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:07:14,502 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2022-04-08 10:07:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 90 transitions. [2022-04-08 10:07:14,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 90 transitions. [2022-04-08 10:07:14,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:14,556 INFO L225 Difference]: With dead ends: 123 [2022-04-08 10:07:14,556 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 10:07:14,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:07:14,556 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:14,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 150 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:07:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 10:07:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 53. [2022-04-08 10:07:14,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:14,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call 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:14,969 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call 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:14,969 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call 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:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:14,970 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2022-04-08 10:07:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-08 10:07:14,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:14,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:14,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 3 states have call successors, (3), 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 118 states. [2022-04-08 10:07:14,970 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 3 states have call successors, (3), 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 118 states. [2022-04-08 10:07:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:14,971 INFO L93 Difference]: Finished difference Result 118 states and 139 transitions. [2022-04-08 10:07:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-08 10:07:14,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:14,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:14,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:14,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call 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:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2022-04-08 10:07:14,972 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 31 [2022-04-08 10:07:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:14,972 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2022-04-08 10:07:14,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 22 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:07:14,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 64 transitions. [2022-04-08 10:07:16,023 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:07:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-08 10:07:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:16,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:16,024 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:16,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:16,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:16,228 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1538637452, now seen corresponding path program 179 times [2022-04-08 10:07:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:16,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1503010720] [2022-04-08 10:07:16,230 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:16,230 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:16,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1538637452, now seen corresponding path program 180 times [2022-04-08 10:07:16,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:16,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292479963] [2022-04-08 10:07:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:16,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {58577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {58552#true} is VALID [2022-04-08 10:07:16,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-08 10:07:16,445 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-08 10:07:16,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {58552#true} call ULTIMATE.init(); {58577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:16,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {58577#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {58552#true} is VALID [2022-04-08 10:07:16,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-08 10:07:16,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-08 10:07:16,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {58552#true} call #t~ret9 := main(); {58552#true} is VALID [2022-04-08 10:07:16,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {58552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58557#(= main_~y~0 0)} is VALID [2022-04-08 10:07:16,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {58557#(= 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; {58558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:16,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {58558#(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; {58559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:16,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {58559#(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; {58560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:16,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {58560#(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; {58561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:16,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {58561#(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; {58562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:16,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {58562#(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; {58563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:16,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {58563#(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; {58564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:16,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {58564#(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; {58565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:16,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {58565#(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; {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:16,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:16,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {58567#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:16,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {58567#(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; {58568#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:16,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {58568#(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; {58569#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:16,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {58569#(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; {58570#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:16,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {58570#(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; {58571#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:16,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {58571#(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; {58572#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:16,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {58572#(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; {58573#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:16,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {58573#(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; {58574#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:16,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {58574#(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; {58575#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:16,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {58575#(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; {58576#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:16,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {58576#(and (<= main_~z~0 0) (<= 0 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; {58553#false} is VALID [2022-04-08 10:07:16,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {58553#false} assume !(~z~0 % 4294967296 > 0); {58553#false} is VALID [2022-04-08 10:07:16,453 INFO L272 TraceCheckUtils]: 28: Hoare triple {58553#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58553#false} is VALID [2022-04-08 10:07:16,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {58553#false} ~cond := #in~cond; {58553#false} is VALID [2022-04-08 10:07:16,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {58553#false} assume 0 == ~cond; {58553#false} is VALID [2022-04-08 10:07:16,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {58553#false} assume !false; {58553#false} is VALID [2022-04-08 10:07:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292479963] [2022-04-08 10:07:16,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292479963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:16,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440954418] [2022-04-08 10:07:16,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:16,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:16,455 INFO L229 MonitoredProcess]: Starting monitored process 109 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:16,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-04-08 10:07:16,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:07:16,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:16,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:07:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:16,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:16,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {58552#true} call ULTIMATE.init(); {58552#true} is VALID [2022-04-08 10:07:16,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {58552#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); {58552#true} is VALID [2022-04-08 10:07:16,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-08 10:07:16,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-08 10:07:16,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {58552#true} call #t~ret9 := main(); {58552#true} is VALID [2022-04-08 10:07:16,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {58552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58557#(= main_~y~0 0)} is VALID [2022-04-08 10:07:16,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {58557#(= 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; {58558#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:16,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {58558#(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; {58559#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:16,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {58559#(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; {58560#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:16,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {58560#(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; {58561#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:16,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {58561#(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; {58562#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:16,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {58562#(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; {58563#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:16,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {58563#(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; {58564#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:16,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {58564#(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; {58565#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:16,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {58565#(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; {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:16,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:16,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {58566#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {58567#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:16,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {58567#(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; {58568#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:16,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {58568#(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; {58569#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:16,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {58569#(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; {58570#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:16,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {58570#(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; {58571#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:16,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {58571#(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; {58572#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:16,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {58572#(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; {58573#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:16,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {58573#(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; {58574#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:16,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {58574#(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; {58575#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:16,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {58575#(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; {58576#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:07:16,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {58576#(and (<= main_~z~0 0) (<= 0 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; {58659#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:07:16,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {58659#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {58553#false} is VALID [2022-04-08 10:07:16,760 INFO L272 TraceCheckUtils]: 28: Hoare triple {58553#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58553#false} is VALID [2022-04-08 10:07:16,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {58553#false} ~cond := #in~cond; {58553#false} is VALID [2022-04-08 10:07:16,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {58553#false} assume 0 == ~cond; {58553#false} is VALID [2022-04-08 10:07:16,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {58553#false} assume !false; {58553#false} is VALID [2022-04-08 10:07:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:16,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:17,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {58553#false} assume !false; {58553#false} is VALID [2022-04-08 10:07:17,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {58553#false} assume 0 == ~cond; {58553#false} is VALID [2022-04-08 10:07:17,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {58553#false} ~cond := #in~cond; {58553#false} is VALID [2022-04-08 10:07:17,257 INFO L272 TraceCheckUtils]: 28: Hoare triple {58553#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58553#false} is VALID [2022-04-08 10:07:17,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {58687#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58553#false} is VALID [2022-04-08 10:07:17,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {58691#(< 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; {58687#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:17,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {58695#(< 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; {58691#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:17,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {58699#(< 0 (mod (+ main_~z~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; {58695#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:17,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {58703#(< 0 (mod (+ 4294967292 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; {58699#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:17,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {58707#(< 0 (mod (+ 4294967291 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; {58703#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:17,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {58711#(< 0 (mod (+ 4294967290 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; {58707#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:17,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {58715#(< 0 (mod (+ main_~z~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; {58711#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:17,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {58719#(< 0 (mod (+ 4294967288 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; {58715#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:17,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {58723#(< 0 (mod (+ main_~z~0 4294967287) 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; {58719#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:17,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {58727#(< 0 (mod (+ main_~z~0 4294967286) 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; {58723#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:07:17,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {58731#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} ~z~0 := ~y~0; {58727#(< 0 (mod (+ main_~z~0 4294967286) 4294967296))} is VALID [2022-04-08 10:07:17,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {58731#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !(~x~0 % 4294967296 > 0); {58731#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:07:17,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {58738#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58731#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:07:17,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {58742#(< 0 (mod (+ 4294967288 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; {58738#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:07:17,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {58746#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {58742#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:17,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {58750#(< 0 (mod (+ 4294967290 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; {58746#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:17,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {58754#(< 0 (mod (+ 4294967291 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; {58750#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:17,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {58758#(< 0 (mod (+ 4294967292 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; {58754#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:17,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {58762#(< 0 (mod (+ main_~y~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; {58758#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:17,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {58766#(< 0 (mod (+ main_~y~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; {58762#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:17,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {58770#(< 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; {58766#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:17,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {58552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58770#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:17,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {58552#true} call #t~ret9 := main(); {58552#true} is VALID [2022-04-08 10:07:17,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58552#true} {58552#true} #50#return; {58552#true} is VALID [2022-04-08 10:07:17,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {58552#true} assume true; {58552#true} is VALID [2022-04-08 10:07:17,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {58552#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); {58552#true} is VALID [2022-04-08 10:07:17,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {58552#true} call ULTIMATE.init(); {58552#true} is VALID [2022-04-08 10:07:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:17,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440954418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:17,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:17,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2022-04-08 10:07:17,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:17,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1503010720] [2022-04-08 10:07:17,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1503010720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:17,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:17,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:07:17,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923621180] [2022-04-08 10:07:17,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:17,271 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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:07:17,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:17,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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:07:17,288 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:07:17,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:07:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:17,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:07:17,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1691, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 10:07:17,289 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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:07:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,127 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-08 10:07:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:07:19,127 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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:07:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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:07:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2022-04-08 10:07:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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:07:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2022-04-08 10:07:19,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 43 transitions. [2022-04-08 10:07:19,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:19,153 INFO L225 Difference]: With dead ends: 68 [2022-04-08 10:07:19,153 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 10:07:19,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=670, Invalid=3490, Unknown=0, NotChecked=0, Total=4160 [2022-04-08 10:07:19,154 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:19,154 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 114 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:07:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 10:07:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-08 10:07:19,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:19,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,610 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,610 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,610 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-08 10:07:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:07:19,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 51 states. [2022-04-08 10:07:19,611 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 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 51 states. [2022-04-08 10:07:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:19,611 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-08 10:07:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:07:19,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:19,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:19,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:19,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call 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,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-08 10:07:19,612 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 32 [2022-04-08 10:07:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:19,612 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-08 10:07:19,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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:07:19,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-08 10:07:20,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-08 10:07:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:20,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:20,696 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:20,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:20,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:20,911 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:20,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1964537077, now seen corresponding path program 181 times [2022-04-08 10:07:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772844874] [2022-04-08 10:07:20,914 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:20,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1964537077, now seen corresponding path program 182 times [2022-04-08 10:07:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:20,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115441773] [2022-04-08 10:07:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {59197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {59171#true} is VALID [2022-04-08 10:07:21,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-08 10:07:21,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-08 10:07:21,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {59171#true} call ULTIMATE.init(); {59197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:21,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {59197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {59171#true} is VALID [2022-04-08 10:07:21,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-08 10:07:21,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-08 10:07:21,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {59171#true} call #t~ret9 := main(); {59171#true} is VALID [2022-04-08 10:07:21,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {59171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59176#(= main_~y~0 0)} is VALID [2022-04-08 10:07:21,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {59176#(= 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; {59177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:21,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {59177#(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; {59178#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {59178#(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; {59179#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:21,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {59179#(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; {59180#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:21,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {59180#(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; {59181#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:21,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {59181#(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; {59182#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:21,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {59182#(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; {59183#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:21,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {59183#(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; {59184#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:21,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {59184#(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; {59185#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:21,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {59185#(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; {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:21,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:21,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {59187#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:21,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {59187#(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; {59188#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:21,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {59188#(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; {59189#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:21,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {59189#(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; {59190#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:21,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {59190#(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; {59191#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:21,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {59191#(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; {59192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:21,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {59192#(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; {59193#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:21,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {59193#(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; {59194#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:21,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {59194#(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; {59195#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:21,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {59195#(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; {59196#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:21,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {59196#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59172#false} is VALID [2022-04-08 10:07:21,307 INFO L272 TraceCheckUtils]: 28: Hoare triple {59172#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59172#false} is VALID [2022-04-08 10:07:21,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {59172#false} ~cond := #in~cond; {59172#false} is VALID [2022-04-08 10:07:21,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {59172#false} assume 0 == ~cond; {59172#false} is VALID [2022-04-08 10:07:21,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {59172#false} assume !false; {59172#false} is VALID [2022-04-08 10:07:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:21,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115441773] [2022-04-08 10:07:21,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115441773] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:21,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628309773] [2022-04-08 10:07:21,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:21,309 INFO L229 MonitoredProcess]: Starting monitored process 110 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,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-04-08 10:07:21,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:21,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:21,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:07:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:21,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {59171#true} call ULTIMATE.init(); {59171#true} is VALID [2022-04-08 10:07:21,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {59171#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); {59171#true} is VALID [2022-04-08 10:07:21,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-08 10:07:21,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-08 10:07:21,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {59171#true} call #t~ret9 := main(); {59171#true} is VALID [2022-04-08 10:07:21,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {59171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59176#(= main_~y~0 0)} is VALID [2022-04-08 10:07:21,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {59176#(= 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; {59177#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:21,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {59177#(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; {59178#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {59178#(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; {59179#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:21,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {59179#(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; {59180#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:21,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {59180#(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; {59181#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:21,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {59181#(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; {59182#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:21,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {59182#(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; {59183#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:21,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {59183#(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; {59184#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:21,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {59184#(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; {59185#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:21,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {59185#(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; {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:21,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:21,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {59186#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {59187#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:21,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {59187#(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; {59188#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:21,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {59188#(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; {59189#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:21,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {59189#(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; {59190#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:21,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {59190#(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; {59191#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:21,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {59191#(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; {59192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:21,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {59192#(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; {59193#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:21,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {59193#(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; {59194#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:21,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {59194#(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; {59195#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:07:21,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {59195#(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; {59279#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:07:21,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {59279#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59172#false} is VALID [2022-04-08 10:07:21,703 INFO L272 TraceCheckUtils]: 28: Hoare triple {59172#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59172#false} is VALID [2022-04-08 10:07:21,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {59172#false} ~cond := #in~cond; {59172#false} is VALID [2022-04-08 10:07:21,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {59172#false} assume 0 == ~cond; {59172#false} is VALID [2022-04-08 10:07:21,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {59172#false} assume !false; {59172#false} is VALID [2022-04-08 10:07:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:21,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:22,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {59172#false} assume !false; {59172#false} is VALID [2022-04-08 10:07:22,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {59172#false} assume 0 == ~cond; {59172#false} is VALID [2022-04-08 10:07:22,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {59172#false} ~cond := #in~cond; {59172#false} is VALID [2022-04-08 10:07:22,424 INFO L272 TraceCheckUtils]: 28: Hoare triple {59172#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59172#false} is VALID [2022-04-08 10:07:22,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {59307#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59172#false} is VALID [2022-04-08 10:07:22,426 INFO L290 TraceCheckUtils]: 26: Hoare triple {59311#(< 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; {59307#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:22,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {59315#(< 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; {59311#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:22,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {59319#(< 0 (mod (+ main_~z~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; {59315#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:22,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {59323#(< 0 (mod (+ 4294967292 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; {59319#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:22,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {59327#(< 0 (mod (+ 4294967291 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; {59323#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:22,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {59331#(< 0 (mod (+ 4294967290 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; {59327#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:22,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {59335#(< 0 (mod (+ main_~z~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; {59331#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:22,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {59339#(< 0 (mod (+ 4294967288 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; {59335#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:22,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {59343#(< 0 (mod (+ main_~z~0 4294967287) 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; {59339#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:22,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {59347#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {59343#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:07:22,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {59347#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59347#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:07:22,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {59354#(< 0 (mod (+ 4294967288 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; {59347#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:07:22,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {59358#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59354#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:22,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {59362#(< 0 (mod (+ 4294967290 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; {59358#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:22,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {59366#(< 0 (mod (+ 4294967291 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; {59362#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:22,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {59370#(< 0 (mod (+ 4294967292 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; {59366#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:22,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {59374#(< 0 (mod (+ main_~y~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; {59370#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:22,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {59378#(< 0 (mod (+ main_~y~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; {59374#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:22,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {59382#(< 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; {59378#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:22,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {59386#(< 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; {59382#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:22,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {59390#(< 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; {59386#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:22,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {59171#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59390#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {59171#true} call #t~ret9 := main(); {59171#true} is VALID [2022-04-08 10:07:22,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59171#true} {59171#true} #50#return; {59171#true} is VALID [2022-04-08 10:07:22,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {59171#true} assume true; {59171#true} is VALID [2022-04-08 10:07:22,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {59171#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); {59171#true} is VALID [2022-04-08 10:07:22,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {59171#true} call ULTIMATE.init(); {59171#true} is VALID [2022-04-08 10:07:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:22,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628309773] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:22,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:22,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:07:22,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:22,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772844874] [2022-04-08 10:07:22,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772844874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:22,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:22,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:07:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822519945] [2022-04-08 10:07:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:22,440 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:22,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:22,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:22,463 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:07:22,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:07:22,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:22,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:07:22,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1768, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:22,464 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:24,644 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-08 10:07:24,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:07:24,644 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. [2022-04-08 10:07:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 46 transitions. [2022-04-08 10:07:24,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 46 transitions. [2022-04-08 10:07:24,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:24,684 INFO L225 Difference]: With dead ends: 67 [2022-04-08 10:07:24,684 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 10:07:24,684 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=3694, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:07:24,684 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:24,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 10:07:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-04-08 10:07:25,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:25,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,240 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,240 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:25,240 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-08 10:07:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-08 10:07:25,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:25,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:25,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 62 states. [2022-04-08 10:07:25,241 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 62 states. [2022-04-08 10:07:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:25,241 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-04-08 10:07:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-08 10:07:25,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:25,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:25,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:25,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:07:25,242 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:07:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:25,242 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:07:25,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:25,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:07:26,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:07:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:26,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:26,407 INFO L499 BasicCegarLoop]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:26,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-04-08 10:07:26,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable110 [2022-04-08 10:07:26,623 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1109045932, now seen corresponding path program 183 times [2022-04-08 10:07:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:26,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317326664] [2022-04-08 10:07:26,625 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:26,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1109045932, now seen corresponding path program 184 times [2022-04-08 10:07:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:26,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709056000] [2022-04-08 10:07:26,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:26,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:26,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {59841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {59815#true} is VALID [2022-04-08 10:07:26,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-08 10:07:26,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-08 10:07:26,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {59815#true} call ULTIMATE.init(); {59841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:26,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {59841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {59815#true} is VALID [2022-04-08 10:07:26,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-08 10:07:26,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-08 10:07:26,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {59815#true} call #t~ret9 := main(); {59815#true} is VALID [2022-04-08 10:07:26,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {59815#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59820#(= main_~y~0 0)} is VALID [2022-04-08 10:07:26,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {59820#(= 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; {59821#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:26,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {59821#(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; {59822#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:26,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {59822#(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; {59823#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:26,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {59823#(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; {59824#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:26,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {59824#(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; {59825#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:26,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {59825#(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; {59826#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:26,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {59826#(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; {59827#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:26,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {59827#(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; {59828#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:26,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {59828#(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; {59829#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:26,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {59829#(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; {59830#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:26,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {59830#(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; {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:26,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:26,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {59832#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:26,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {59832#(and (<= main_~z~0 11) (<= 11 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; {59833#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:26,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {59833#(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; {59834#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:26,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {59834#(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; {59835#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:26,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {59835#(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; {59836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:26,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {59836#(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; {59837#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:26,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {59837#(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; {59838#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:26,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {59838#(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; {59839#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:26,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {59839#(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; {59840#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:26,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {59840#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {59816#false} is VALID [2022-04-08 10:07:26,879 INFO L272 TraceCheckUtils]: 28: Hoare triple {59816#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59816#false} is VALID [2022-04-08 10:07:26,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {59816#false} ~cond := #in~cond; {59816#false} is VALID [2022-04-08 10:07:26,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {59816#false} assume 0 == ~cond; {59816#false} is VALID [2022-04-08 10:07:26,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {59816#false} assume !false; {59816#false} is VALID [2022-04-08 10:07:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:26,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:26,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709056000] [2022-04-08 10:07:26,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709056000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:26,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107334962] [2022-04-08 10:07:26,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:26,881 INFO L229 MonitoredProcess]: Starting monitored process 111 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:26,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-04-08 10:07:26,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:26,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:26,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:07:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:26,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:27,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {59815#true} call ULTIMATE.init(); {59815#true} is VALID [2022-04-08 10:07:27,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {59815#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); {59815#true} is VALID [2022-04-08 10:07:27,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-08 10:07:27,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-08 10:07:27,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {59815#true} call #t~ret9 := main(); {59815#true} is VALID [2022-04-08 10:07:27,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {59815#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59820#(= main_~y~0 0)} is VALID [2022-04-08 10:07:27,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {59820#(= 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; {59821#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:27,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {59821#(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; {59822#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:27,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {59822#(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; {59823#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:27,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {59823#(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; {59824#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:27,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {59824#(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; {59825#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:27,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {59825#(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; {59826#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:27,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {59826#(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; {59827#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:27,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {59827#(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; {59828#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:27,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {59828#(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; {59829#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:27,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {59829#(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; {59830#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:27,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {59830#(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; {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:27,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:27,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {59831#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {59832#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:27,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {59832#(and (<= main_~z~0 11) (<= 11 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; {59833#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:27,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {59833#(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; {59834#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:27,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {59834#(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; {59835#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:27,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {59835#(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; {59836#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:27,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {59836#(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; {59837#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:27,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {59837#(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; {59838#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:27,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {59838#(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; {59839#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:27,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {59839#(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; {59923#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:07:27,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {59923#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59816#false} is VALID [2022-04-08 10:07:27,159 INFO L272 TraceCheckUtils]: 28: Hoare triple {59816#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59816#false} is VALID [2022-04-08 10:07:27,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {59816#false} ~cond := #in~cond; {59816#false} is VALID [2022-04-08 10:07:27,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {59816#false} assume 0 == ~cond; {59816#false} is VALID [2022-04-08 10:07:27,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {59816#false} assume !false; {59816#false} is VALID [2022-04-08 10:07:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:27,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {59816#false} assume !false; {59816#false} is VALID [2022-04-08 10:07:27,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {59816#false} assume 0 == ~cond; {59816#false} is VALID [2022-04-08 10:07:27,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {59816#false} ~cond := #in~cond; {59816#false} is VALID [2022-04-08 10:07:27,687 INFO L272 TraceCheckUtils]: 28: Hoare triple {59816#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59816#false} is VALID [2022-04-08 10:07:27,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {59951#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59816#false} is VALID [2022-04-08 10:07:27,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {59955#(< 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; {59951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:27,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {59959#(< 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; {59955#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:27,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {59963#(< 0 (mod (+ main_~z~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; {59959#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:27,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {59967#(< 0 (mod (+ 4294967292 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; {59963#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:27,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {59971#(< 0 (mod (+ 4294967291 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; {59967#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:27,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {59975#(< 0 (mod (+ 4294967290 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; {59971#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:27,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {59979#(< 0 (mod (+ main_~z~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; {59975#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:27,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {59983#(< 0 (mod (+ 4294967288 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; {59979#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:27,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {59987#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {59983#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:27,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {59987#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59987#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:27,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {59994#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59987#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:27,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {59998#(< 0 (mod (+ 4294967290 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; {59994#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:27,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {60002#(< 0 (mod (+ 4294967291 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; {59998#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:27,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {60006#(< 0 (mod (+ 4294967292 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; {60002#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:27,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {60010#(< 0 (mod (+ main_~y~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; {60006#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:27,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {60014#(< 0 (mod (+ main_~y~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; {60010#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:27,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {60018#(< 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; {60014#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:27,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {60022#(< 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; {60018#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:27,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {60026#(< 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; {60022#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:27,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {60030#(< 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; {60026#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:27,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {60034#(< 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; {60030#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:27,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {59815#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60034#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:27,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {59815#true} call #t~ret9 := main(); {59815#true} is VALID [2022-04-08 10:07:27,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59815#true} {59815#true} #50#return; {59815#true} is VALID [2022-04-08 10:07:27,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {59815#true} assume true; {59815#true} is VALID [2022-04-08 10:07:27,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {59815#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); {59815#true} is VALID [2022-04-08 10:07:27,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {59815#true} call ULTIMATE.init(); {59815#true} is VALID [2022-04-08 10:07:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:27,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107334962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:27,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:27,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:07:27,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:27,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317326664] [2022-04-08 10:07:27,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317326664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:27,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:27,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:07:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581171415] [2022-04-08 10:07:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:27,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:27,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:27,716 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:07:27,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:07:27,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:27,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:07:27,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:27,716 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:30,033 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-08 10:07:30,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:07:30,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-08 10:07:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:30,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2022-04-08 10:07:30,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 59 transitions. [2022-04-08 10:07:30,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:30,065 INFO L225 Difference]: With dead ends: 77 [2022-04-08 10:07:30,065 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 10:07:30,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=961, Invalid=4589, Unknown=0, NotChecked=0, Total=5550 [2022-04-08 10:07:30,066 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:30,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 114 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:07:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 10:07:30,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2022-04-08 10:07:30,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:30,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,482 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,482 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:30,483 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 10:07:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-08 10:07:30,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:30,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:30,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 72 states. [2022-04-08 10:07:30,483 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 72 states. [2022-04-08 10:07:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:30,483 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 10:07:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-04-08 10:07:30,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:30,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:30,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:30,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:07:30,484 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:07:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:30,484 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:07:30,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:30,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:07:31,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:07:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:31,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:31,714 INFO L499 BasicCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:31,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:31,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-04-08 10:07:31,914 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1208193771, now seen corresponding path program 185 times [2022-04-08 10:07:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:31,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186618291] [2022-04-08 10:07:31,922 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:31,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1208193771, now seen corresponding path program 186 times [2022-04-08 10:07:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:31,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012307614] [2022-04-08 10:07:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:31,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {60541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {60515#true} is VALID [2022-04-08 10:07:32,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-08 10:07:32,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-08 10:07:32,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {60515#true} call ULTIMATE.init(); {60541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:32,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {60541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {60515#true} is VALID [2022-04-08 10:07:32,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-08 10:07:32,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-08 10:07:32,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {60515#true} call #t~ret9 := main(); {60515#true} is VALID [2022-04-08 10:07:32,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {60515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60520#(= main_~y~0 0)} is VALID [2022-04-08 10:07:32,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {60520#(= 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; {60521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:32,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {60521#(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; {60522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:32,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {60522#(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; {60523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:32,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {60523#(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; {60524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:32,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {60524#(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; {60525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:32,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {60525#(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; {60526#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:32,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {60526#(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; {60527#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:32,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {60527#(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; {60528#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:32,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {60528#(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; {60529#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:32,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {60529#(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; {60530#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:32,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {60530#(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; {60531#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:32,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {60531#(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; {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:32,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:32,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {60533#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:32,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {60533#(and (<= main_~z~0 12) (<= 12 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; {60534#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:32,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {60534#(and (<= main_~z~0 11) (<= 11 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; {60535#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:32,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {60535#(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; {60536#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:32,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {60536#(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; {60537#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:32,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {60537#(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; {60538#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:32,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {60538#(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; {60539#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:32,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {60539#(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; {60540#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:32,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {60540#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {60516#false} is VALID [2022-04-08 10:07:32,298 INFO L272 TraceCheckUtils]: 28: Hoare triple {60516#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60516#false} is VALID [2022-04-08 10:07:32,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {60516#false} ~cond := #in~cond; {60516#false} is VALID [2022-04-08 10:07:32,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {60516#false} assume 0 == ~cond; {60516#false} is VALID [2022-04-08 10:07:32,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {60516#false} assume !false; {60516#false} is VALID [2022-04-08 10:07:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:32,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012307614] [2022-04-08 10:07:32,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012307614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94842784] [2022-04-08 10:07:32,299 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:32,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:32,300 INFO L229 MonitoredProcess]: Starting monitored process 112 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,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-04-08 10:07:32,380 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:07:32,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:32,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:07:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:32,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:32,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {60515#true} call ULTIMATE.init(); {60515#true} is VALID [2022-04-08 10:07:32,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {60515#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); {60515#true} is VALID [2022-04-08 10:07:32,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-08 10:07:32,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-08 10:07:32,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {60515#true} call #t~ret9 := main(); {60515#true} is VALID [2022-04-08 10:07:32,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {60515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60520#(= main_~y~0 0)} is VALID [2022-04-08 10:07:32,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {60520#(= 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; {60521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:32,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {60521#(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; {60522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:32,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {60522#(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; {60523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:32,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {60523#(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; {60524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:32,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {60524#(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; {60525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:32,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {60525#(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; {60526#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:32,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {60526#(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; {60527#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:32,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {60527#(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; {60528#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:32,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {60528#(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; {60529#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:32,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {60529#(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; {60530#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:32,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {60530#(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; {60531#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:32,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {60531#(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; {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:32,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:32,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {60532#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {60533#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:32,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {60533#(and (<= main_~z~0 12) (<= 12 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; {60534#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:32,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {60534#(and (<= main_~z~0 11) (<= 11 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; {60535#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:32,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {60535#(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; {60536#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:32,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {60536#(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; {60537#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:32,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {60537#(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; {60538#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:32,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {60538#(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; {60539#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:32,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {60539#(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; {60623#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:32,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {60623#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {60516#false} is VALID [2022-04-08 10:07:32,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {60516#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60516#false} is VALID [2022-04-08 10:07:32,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {60516#false} ~cond := #in~cond; {60516#false} is VALID [2022-04-08 10:07:32,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {60516#false} assume 0 == ~cond; {60516#false} is VALID [2022-04-08 10:07:32,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {60516#false} assume !false; {60516#false} is VALID [2022-04-08 10:07:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:32,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:33,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {60516#false} assume !false; {60516#false} is VALID [2022-04-08 10:07:33,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {60516#false} assume 0 == ~cond; {60516#false} is VALID [2022-04-08 10:07:33,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {60516#false} ~cond := #in~cond; {60516#false} is VALID [2022-04-08 10:07:33,455 INFO L272 TraceCheckUtils]: 28: Hoare triple {60516#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60516#false} is VALID [2022-04-08 10:07:33,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {60651#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {60516#false} is VALID [2022-04-08 10:07:33,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {60655#(< 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; {60651#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:33,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {60659#(< 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; {60655#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:33,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {60663#(< 0 (mod (+ main_~z~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; {60659#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:33,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {60667#(< 0 (mod (+ 4294967292 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; {60663#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:33,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {60671#(< 0 (mod (+ 4294967291 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; {60667#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:33,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {60675#(< 0 (mod (+ 4294967290 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; {60671#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:33,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {60679#(< 0 (mod (+ main_~z~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; {60675#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:33,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {60683#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {60679#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:33,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {60683#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {60683#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:33,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {60690#(< 0 (mod (+ 4294967290 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; {60683#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:07:33,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {60694#(< 0 (mod (+ 4294967291 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; {60690#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:33,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {60698#(< 0 (mod (+ 4294967292 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; {60694#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:33,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {60702#(< 0 (mod (+ main_~y~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; {60698#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:33,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {60706#(< 0 (mod (+ main_~y~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; {60702#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:33,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {60710#(< 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; {60706#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:33,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {60714#(< 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; {60710#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:33,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {60718#(< 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; {60714#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:33,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {60722#(< 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; {60718#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:33,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {60726#(< 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; {60722#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:33,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {60730#(< 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; {60726#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:33,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {60734#(< 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; {60730#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:33,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {60515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60734#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:33,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {60515#true} call #t~ret9 := main(); {60515#true} is VALID [2022-04-08 10:07:33,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60515#true} {60515#true} #50#return; {60515#true} is VALID [2022-04-08 10:07:33,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {60515#true} assume true; {60515#true} is VALID [2022-04-08 10:07:33,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {60515#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); {60515#true} is VALID [2022-04-08 10:07:33,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {60515#true} call ULTIMATE.init(); {60515#true} is VALID [2022-04-08 10:07:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:33,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94842784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:33,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:33,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:07:33,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:33,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186618291] [2022-04-08 10:07:33,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186618291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:33,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:33,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:07:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493195828] [2022-04-08 10:07:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:33,471 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:33,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:33,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:33,493 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:07:33,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:07:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:07:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=1746, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:33,494 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:37,721 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-08 10:07:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-08 10:07:37,721 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 69 transitions. [2022-04-08 10:07:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 69 transitions. [2022-04-08 10:07:37,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 69 transitions. [2022-04-08 10:07:37,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:37,778 INFO L225 Difference]: With dead ends: 86 [2022-04-08 10:07:37,778 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 10:07:37,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1125, Invalid=5195, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:07:37,778 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:37,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:07:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 10:07:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 52. [2022-04-08 10:07:38,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:38,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:38,368 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:38,368 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:38,369 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-08 10:07:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-08 10:07:38,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:38,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:38,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 81 states. [2022-04-08 10:07:38,369 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 81 states. [2022-04-08 10:07:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:38,370 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-08 10:07:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-04-08 10:07:38,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:38,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:38,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:38,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:38,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:07:38,371 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:07:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:38,371 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:07:38,371 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:38,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:07:39,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:07:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:39,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:39,591 INFO L499 BasicCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:39,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:39,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-04-08 10:07:39,807 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash 795750092, now seen corresponding path program 187 times [2022-04-08 10:07:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:39,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848213015] [2022-04-08 10:07:39,811 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:39,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 795750092, now seen corresponding path program 188 times [2022-04-08 10:07:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:39,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863335077] [2022-04-08 10:07:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {61287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {61261#true} is VALID [2022-04-08 10:07:40,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-08 10:07:40,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-08 10:07:40,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {61261#true} call ULTIMATE.init(); {61287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:40,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {61287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {61261#true} is VALID [2022-04-08 10:07:40,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-08 10:07:40,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-08 10:07:40,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {61261#true} call #t~ret9 := main(); {61261#true} is VALID [2022-04-08 10:07:40,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {61261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61266#(= main_~y~0 0)} is VALID [2022-04-08 10:07:40,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {61266#(= 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; {61267#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:40,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#(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; {61268#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:40,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {61268#(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; {61269#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:40,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {61269#(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; {61270#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:40,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {61270#(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; {61271#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:40,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {61271#(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; {61272#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:40,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {61272#(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; {61273#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:40,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {61273#(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; {61274#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:40,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {61274#(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; {61275#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:40,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {61275#(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; {61276#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:40,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {61276#(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; {61277#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:40,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {61277#(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; {61278#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:40,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {61278#(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; {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:40,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:40,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {61280#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:40,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {61280#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61281#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:40,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {61281#(and (<= main_~z~0 12) (<= 12 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; {61282#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:40,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {61282#(and (<= main_~z~0 11) (<= 11 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; {61283#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:40,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {61283#(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; {61284#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:40,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {61284#(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; {61285#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:40,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {61285#(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; {61286#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:40,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {61286#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {61262#false} is VALID [2022-04-08 10:07:40,206 INFO L272 TraceCheckUtils]: 28: Hoare triple {61262#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61262#false} is VALID [2022-04-08 10:07:40,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {61262#false} ~cond := #in~cond; {61262#false} is VALID [2022-04-08 10:07:40,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {61262#false} assume 0 == ~cond; {61262#false} is VALID [2022-04-08 10:07:40,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {61262#false} assume !false; {61262#false} is VALID [2022-04-08 10:07:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:40,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:40,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863335077] [2022-04-08 10:07:40,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863335077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:40,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808029136] [2022-04-08 10:07:40,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:40,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:40,208 INFO L229 MonitoredProcess]: Starting monitored process 113 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,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-04-08 10:07:40,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:40,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:40,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:07:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:40,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {61261#true} call ULTIMATE.init(); {61261#true} is VALID [2022-04-08 10:07:40,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {61261#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); {61261#true} is VALID [2022-04-08 10:07:40,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-08 10:07:40,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-08 10:07:40,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {61261#true} call #t~ret9 := main(); {61261#true} is VALID [2022-04-08 10:07:40,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {61261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61266#(= main_~y~0 0)} is VALID [2022-04-08 10:07:40,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {61266#(= 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; {61267#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:40,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#(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; {61268#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:40,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {61268#(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; {61269#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:40,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {61269#(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; {61270#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:40,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {61270#(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; {61271#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:40,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {61271#(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; {61272#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:40,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {61272#(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; {61273#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:40,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {61273#(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; {61274#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:40,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {61274#(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; {61275#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:40,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {61275#(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; {61276#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:40,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {61276#(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; {61277#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:40,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {61277#(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; {61278#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:40,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {61278#(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; {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:40,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:40,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {61279#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {61280#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:40,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {61280#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {61281#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:40,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {61281#(and (<= main_~z~0 12) (<= 12 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; {61282#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:40,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {61282#(and (<= main_~z~0 11) (<= 11 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; {61283#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:40,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {61283#(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; {61284#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:40,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {61284#(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; {61285#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:40,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {61285#(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; {61369#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:40,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {61369#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {61262#false} is VALID [2022-04-08 10:07:40,600 INFO L272 TraceCheckUtils]: 28: Hoare triple {61262#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61262#false} is VALID [2022-04-08 10:07:40,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {61262#false} ~cond := #in~cond; {61262#false} is VALID [2022-04-08 10:07:40,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {61262#false} assume 0 == ~cond; {61262#false} is VALID [2022-04-08 10:07:40,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {61262#false} assume !false; {61262#false} is VALID [2022-04-08 10:07:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:40,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:41,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {61262#false} assume !false; {61262#false} is VALID [2022-04-08 10:07:41,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {61262#false} assume 0 == ~cond; {61262#false} is VALID [2022-04-08 10:07:41,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {61262#false} ~cond := #in~cond; {61262#false} is VALID [2022-04-08 10:07:41,320 INFO L272 TraceCheckUtils]: 28: Hoare triple {61262#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61262#false} is VALID [2022-04-08 10:07:41,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {61397#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61262#false} is VALID [2022-04-08 10:07:41,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {61401#(< 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; {61397#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:41,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {61405#(< 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; {61401#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:41,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {61409#(< 0 (mod (+ main_~z~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; {61405#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:41,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {61413#(< 0 (mod (+ 4294967292 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; {61409#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:41,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {61417#(< 0 (mod (+ 4294967291 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; {61413#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:41,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {61421#(< 0 (mod (+ 4294967290 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; {61417#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:41,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {61425#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {61421#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:41,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {61425#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {61425#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:41,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {61432#(< 0 (mod (+ 4294967291 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; {61425#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:41,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {61436#(< 0 (mod (+ 4294967292 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; {61432#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:41,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {61440#(< 0 (mod (+ main_~y~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; {61436#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:41,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {61444#(< 0 (mod (+ main_~y~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; {61440#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:41,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {61448#(< 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; {61444#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:41,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {61452#(< 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; {61448#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:41,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {61456#(< 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; {61452#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:41,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {61460#(< 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; {61456#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:41,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {61464#(< 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; {61460#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:41,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {61468#(< 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; {61464#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:41,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {61472#(< 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; {61468#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:41,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {61476#(< 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; {61472#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:41,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {61480#(< 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; {61476#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:41,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {61261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61480#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:41,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {61261#true} call #t~ret9 := main(); {61261#true} is VALID [2022-04-08 10:07:41,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61261#true} {61261#true} #50#return; {61261#true} is VALID [2022-04-08 10:07:41,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {61261#true} assume true; {61261#true} is VALID [2022-04-08 10:07:41,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {61261#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); {61261#true} is VALID [2022-04-08 10:07:41,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {61261#true} call ULTIMATE.init(); {61261#true} is VALID [2022-04-08 10:07:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:41,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808029136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:41,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:41,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:07:41,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848213015] [2022-04-08 10:07:41,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848213015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:41,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:41,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:07:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805942928] [2022-04-08 10:07:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:41,337 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:41,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:41,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:41,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:07:41,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:07:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:41,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:07:41,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1729, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:41,359 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:44,997 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-08 10:07:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-08 10:07:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 76 transitions. [2022-04-08 10:07:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 76 transitions. [2022-04-08 10:07:44,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 76 transitions. [2022-04-08 10:07:45,039 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:45,040 INFO L225 Difference]: With dead ends: 94 [2022-04-08 10:07:45,040 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 10:07:45,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1216, Invalid=5426, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:07:45,040 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:45,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 125 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:07:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 10:07:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2022-04-08 10:07:45,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:45,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,585 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,585 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:45,585 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-04-08 10:07:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-04-08 10:07:45,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:45,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:45,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 89 states. [2022-04-08 10:07:45,586 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 89 states. [2022-04-08 10:07:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:45,586 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2022-04-08 10:07:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-04-08 10:07:45,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:45,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:45,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:45,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:07:45,587 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:07:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:45,587 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:07:45,587 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:45,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:07:46,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:07:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:46,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:46,935 INFO L499 BasicCegarLoop]: trace histogram [14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:46,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:47,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-04-08 10:07:47,141 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1572859189, now seen corresponding path program 189 times [2022-04-08 10:07:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:47,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466291954] [2022-04-08 10:07:47,143 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:47,143 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1572859189, now seen corresponding path program 190 times [2022-04-08 10:07:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:47,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554409721] [2022-04-08 10:07:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:47,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:47,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {62069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {62043#true} is VALID [2022-04-08 10:07:47,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-08 10:07:47,503 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-08 10:07:47,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {62043#true} call ULTIMATE.init(); {62069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:47,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {62069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {62043#true} is VALID [2022-04-08 10:07:47,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-08 10:07:47,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-08 10:07:47,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {62043#true} call #t~ret9 := main(); {62043#true} is VALID [2022-04-08 10:07:47,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {62043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62048#(= main_~y~0 0)} is VALID [2022-04-08 10:07:47,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {62048#(= 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; {62049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:47,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {62049#(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; {62050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:47,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {62050#(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; {62051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:47,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {62051#(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; {62052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:47,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {62052#(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; {62053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:47,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {62053#(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; {62054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:47,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {62054#(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; {62055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:47,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {62055#(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; {62056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:47,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {62056#(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; {62057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:47,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {62057#(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; {62058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:47,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {62058#(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; {62059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:47,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {62059#(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; {62060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:47,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {62060#(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; {62061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:47,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {62061#(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; {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:47,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:47,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {62063#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:07:47,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {62063#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62064#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:47,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {62064#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62065#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:47,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {62065#(and (<= main_~z~0 12) (<= 12 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; {62066#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:47,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {62066#(and (<= main_~z~0 11) (<= 11 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; {62067#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:47,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {62067#(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; {62068#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:47,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {62068#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {62044#false} is VALID [2022-04-08 10:07:47,515 INFO L272 TraceCheckUtils]: 28: Hoare triple {62044#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62044#false} is VALID [2022-04-08 10:07:47,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {62044#false} ~cond := #in~cond; {62044#false} is VALID [2022-04-08 10:07:47,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {62044#false} assume 0 == ~cond; {62044#false} is VALID [2022-04-08 10:07:47,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {62044#false} assume !false; {62044#false} is VALID [2022-04-08 10:07:47,516 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:07:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554409721] [2022-04-08 10:07:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554409721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847082429] [2022-04-08 10:07:47,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:47,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:47,517 INFO L229 MonitoredProcess]: Starting monitored process 114 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:47,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-04-08 10:07:47,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:47,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:47,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:07:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:47,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:47,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {62043#true} call ULTIMATE.init(); {62043#true} is VALID [2022-04-08 10:07:47,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {62043#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); {62043#true} is VALID [2022-04-08 10:07:47,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-08 10:07:47,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-08 10:07:47,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {62043#true} call #t~ret9 := main(); {62043#true} is VALID [2022-04-08 10:07:47,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {62043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62048#(= main_~y~0 0)} is VALID [2022-04-08 10:07:47,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {62048#(= 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; {62049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:47,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {62049#(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; {62050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:47,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {62050#(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; {62051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:47,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {62051#(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; {62052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:47,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {62052#(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; {62053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:47,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {62053#(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; {62054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:47,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {62054#(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; {62055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:47,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {62055#(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; {62056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:47,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {62056#(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; {62057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:47,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {62057#(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; {62058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:47,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {62058#(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; {62059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:47,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {62059#(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; {62060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:47,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {62060#(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; {62061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:47,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {62061#(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; {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:47,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:47,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {62062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {62063#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:07:47,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {62063#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62064#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:47,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {62064#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62065#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:47,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {62065#(and (<= main_~z~0 12) (<= 12 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; {62066#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:47,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {62066#(and (<= main_~z~0 11) (<= 11 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; {62067#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:07:47,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {62067#(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; {62151#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:47,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {62151#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {62044#false} is VALID [2022-04-08 10:07:47,904 INFO L272 TraceCheckUtils]: 28: Hoare triple {62044#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62044#false} is VALID [2022-04-08 10:07:47,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {62044#false} ~cond := #in~cond; {62044#false} is VALID [2022-04-08 10:07:47,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {62044#false} assume 0 == ~cond; {62044#false} is VALID [2022-04-08 10:07:47,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {62044#false} assume !false; {62044#false} is VALID [2022-04-08 10:07:47,904 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:07:47,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:48,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {62044#false} assume !false; {62044#false} is VALID [2022-04-08 10:07:48,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {62044#false} assume 0 == ~cond; {62044#false} is VALID [2022-04-08 10:07:48,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {62044#false} ~cond := #in~cond; {62044#false} is VALID [2022-04-08 10:07:48,697 INFO L272 TraceCheckUtils]: 28: Hoare triple {62044#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62044#false} is VALID [2022-04-08 10:07:48,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {62179#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62044#false} is VALID [2022-04-08 10:07:48,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {62183#(< 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; {62179#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:48,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {62187#(< 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; {62183#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:48,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {62191#(< 0 (mod (+ main_~z~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; {62187#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:48,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {62195#(< 0 (mod (+ 4294967292 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; {62191#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:48,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {62199#(< 0 (mod (+ 4294967291 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; {62195#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:48,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {62203#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {62199#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:48,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {62203#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {62203#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:48,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {62210#(< 0 (mod (+ 4294967292 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; {62203#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:48,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {62214#(< 0 (mod (+ main_~y~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; {62210#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:48,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {62218#(< 0 (mod (+ main_~y~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; {62214#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:48,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {62222#(< 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; {62218#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:48,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {62226#(< 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; {62222#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:48,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {62230#(< 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; {62226#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:48,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {62234#(< 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; {62230#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:48,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {62238#(< 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; {62234#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:48,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {62242#(< 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; {62238#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:48,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {62246#(< 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; {62242#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:48,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {62250#(< 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; {62246#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:48,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {62254#(< 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; {62250#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:48,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {62258#(< 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; {62254#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:48,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {62262#(< 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; {62258#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:48,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {62043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62262#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:48,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {62043#true} call #t~ret9 := main(); {62043#true} is VALID [2022-04-08 10:07:48,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62043#true} {62043#true} #50#return; {62043#true} is VALID [2022-04-08 10:07:48,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {62043#true} assume true; {62043#true} is VALID [2022-04-08 10:07:48,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {62043#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); {62043#true} is VALID [2022-04-08 10:07:48,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {62043#true} call ULTIMATE.init(); {62043#true} is VALID [2022-04-08 10:07:48,717 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:07:48,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847082429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:48,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:48,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:07:48,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:48,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466291954] [2022-04-08 10:07:48,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466291954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:48,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:48,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:07:48,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626862023] [2022-04-08 10:07:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:48,718 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:48,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:48,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:48,746 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:07:48,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:07:48,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:48,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:07:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:48,747 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:52,546 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-04-08 10:07:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 10:07:52,546 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 80 transitions. [2022-04-08 10:07:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 80 transitions. [2022-04-08 10:07:52,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 80 transitions. [2022-04-08 10:07:52,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:52,590 INFO L225 Difference]: With dead ends: 101 [2022-04-08 10:07:52,590 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 10:07:52,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1205, Invalid=5275, Unknown=0, NotChecked=0, Total=6480 [2022-04-08 10:07:52,590 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:52,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 108 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:07:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 10:07:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 52. [2022-04-08 10:07:53,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:53,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,032 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,032 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:53,033 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-08 10:07:53,033 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-08 10:07:53,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:53,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:53,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 96 states. [2022-04-08 10:07:53,034 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 96 states. [2022-04-08 10:07:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:53,034 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-08 10:07:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-08 10:07:53,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:53,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:53,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:53,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:07:53,035 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:07:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:53,035 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:07:53,035 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:53,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:07:54,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:07:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:07:54,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:54,278 INFO L499 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:54,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:54,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:54,494 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:54,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1649265940, now seen corresponding path program 191 times [2022-04-08 10:07:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:54,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373886226] [2022-04-08 10:07:54,496 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:54,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1649265940, now seen corresponding path program 192 times [2022-04-08 10:07:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:54,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962801767] [2022-04-08 10:07:54,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:54,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {62877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {62851#true} is VALID [2022-04-08 10:07:54,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-08 10:07:54,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-08 10:07:54,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {62851#true} call ULTIMATE.init(); {62877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:54,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {62877#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {62851#true} is VALID [2022-04-08 10:07:54,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-08 10:07:54,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-08 10:07:54,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {62851#true} call #t~ret9 := main(); {62851#true} is VALID [2022-04-08 10:07:54,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {62851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62856#(= main_~y~0 0)} is VALID [2022-04-08 10:07:54,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {62856#(= 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; {62857#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:54,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {62857#(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; {62858#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:54,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {62858#(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; {62859#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:54,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {62859#(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; {62860#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:54,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {62860#(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; {62861#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:54,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {62861#(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; {62862#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:54,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {62862#(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; {62863#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:54,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {62863#(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; {62864#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:54,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {62864#(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; {62865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:54,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {62865#(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; {62866#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:54,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {62866#(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; {62867#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:54,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {62867#(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; {62868#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:54,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {62868#(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; {62869#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:54,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {62869#(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; {62870#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:54,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {62870#(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; {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:54,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:54,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {62872#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:07:54,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {62872#(and (<= main_~z~0 15) (<= 15 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; {62873#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:07:54,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {62873#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62874#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:54,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {62874#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62875#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:54,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {62875#(and (<= main_~z~0 12) (<= 12 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; {62876#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:54,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {62876#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {62852#false} is VALID [2022-04-08 10:07:54,744 INFO L272 TraceCheckUtils]: 28: Hoare triple {62852#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62852#false} is VALID [2022-04-08 10:07:54,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {62852#false} ~cond := #in~cond; {62852#false} is VALID [2022-04-08 10:07:54,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {62852#false} assume 0 == ~cond; {62852#false} is VALID [2022-04-08 10:07:54,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {62852#false} assume !false; {62852#false} is VALID [2022-04-08 10:07:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:54,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962801767] [2022-04-08 10:07:54,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962801767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:54,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182796397] [2022-04-08 10:07:54,744 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:54,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:54,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:54,745 INFO L229 MonitoredProcess]: Starting monitored process 115 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,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-04-08 10:07:54,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:07:54,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:54,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:07:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:54,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:55,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {62851#true} call ULTIMATE.init(); {62851#true} is VALID [2022-04-08 10:07:55,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {62851#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); {62851#true} is VALID [2022-04-08 10:07:55,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-08 10:07:55,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-08 10:07:55,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {62851#true} call #t~ret9 := main(); {62851#true} is VALID [2022-04-08 10:07:55,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {62851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62856#(= main_~y~0 0)} is VALID [2022-04-08 10:07:55,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {62856#(= 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; {62857#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:55,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {62857#(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; {62858#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:55,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {62858#(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; {62859#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:55,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {62859#(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; {62860#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:55,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {62860#(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; {62861#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:55,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {62861#(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; {62862#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:55,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {62862#(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; {62863#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:55,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {62863#(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; {62864#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:55,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {62864#(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; {62865#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:55,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {62865#(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; {62866#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:55,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {62866#(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; {62867#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:55,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {62867#(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; {62868#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:55,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {62868#(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; {62869#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:55,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {62869#(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; {62870#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:55,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {62870#(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; {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:55,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:55,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {62871#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {62872#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:07:55,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {62872#(and (<= main_~z~0 15) (<= 15 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; {62873#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:07:55,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {62873#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62874#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:07:55,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {62874#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62875#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:07:55,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {62875#(and (<= main_~z~0 12) (<= 12 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; {62959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:07:55,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {62959#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {62852#false} is VALID [2022-04-08 10:07:55,314 INFO L272 TraceCheckUtils]: 28: Hoare triple {62852#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62852#false} is VALID [2022-04-08 10:07:55,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {62852#false} ~cond := #in~cond; {62852#false} is VALID [2022-04-08 10:07:55,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {62852#false} assume 0 == ~cond; {62852#false} is VALID [2022-04-08 10:07:55,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {62852#false} assume !false; {62852#false} is VALID [2022-04-08 10:07:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:55,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:56,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {62852#false} assume !false; {62852#false} is VALID [2022-04-08 10:07:56,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {62852#false} assume 0 == ~cond; {62852#false} is VALID [2022-04-08 10:07:56,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {62852#false} ~cond := #in~cond; {62852#false} is VALID [2022-04-08 10:07:56,026 INFO L272 TraceCheckUtils]: 28: Hoare triple {62852#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62852#false} is VALID [2022-04-08 10:07:56,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {62987#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62852#false} is VALID [2022-04-08 10:07:56,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {62991#(< 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; {62987#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:56,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {62995#(< 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; {62991#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:56,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {62999#(< 0 (mod (+ main_~z~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; {62995#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:56,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {63003#(< 0 (mod (+ 4294967292 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; {62999#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:56,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {63007#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {63003#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:07:56,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {63007#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {63007#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:56,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {63014#(< 0 (mod (+ main_~y~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; {63007#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:56,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {63018#(< 0 (mod (+ main_~y~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; {63014#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:56,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {63022#(< 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; {63018#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:56,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {63026#(< 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; {63022#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:56,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {63030#(< 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; {63026#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:56,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {63034#(< 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; {63030#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:56,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {63038#(< 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; {63034#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:56,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {63042#(< 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; {63038#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:56,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {63046#(< 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; {63042#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:56,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {63050#(< 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; {63046#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:56,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {63054#(< 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; {63050#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:56,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {63058#(< 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; {63054#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:56,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {63062#(< 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; {63058#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:56,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {63066#(< 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; {63062#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:56,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {63070#(< 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; {63066#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:56,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {62851#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63070#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:56,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {62851#true} call #t~ret9 := main(); {62851#true} is VALID [2022-04-08 10:07:56,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62851#true} {62851#true} #50#return; {62851#true} is VALID [2022-04-08 10:07:56,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {62851#true} assume true; {62851#true} is VALID [2022-04-08 10:07:56,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {62851#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); {62851#true} is VALID [2022-04-08 10:07:56,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {62851#true} call ULTIMATE.init(); {62851#true} is VALID [2022-04-08 10:07:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182796397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:56,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:56,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:07:56,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:56,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373886226] [2022-04-08 10:07:56,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373886226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:56,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:56,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:07:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158572560] [2022-04-08 10:07:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:56,039 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:56,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:56,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:56,053 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:07:56,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:07:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:56,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:07:56,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1695, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:07:56,054 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:59,803 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2022-04-08 10:07:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:07:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-08 10:07:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:07:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 81 transitions. [2022-04-08 10:07:59,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 81 transitions. [2022-04-08 10:07:59,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:59,848 INFO L225 Difference]: With dead ends: 107 [2022-04-08 10:07:59,849 INFO L226 Difference]: Without dead ends: 102 [2022-04-08 10:07:59,849 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1115, Invalid=4737, Unknown=0, NotChecked=0, Total=5852 [2022-04-08 10:07:59,849 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 48 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:59,849 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 137 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:07:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-08 10:08:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 52. [2022-04-08 10:08:00,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:00,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:00,293 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:00,293 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:00,294 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-04-08 10:08:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-04-08 10:08:00,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:00,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:00,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 102 states. [2022-04-08 10:08:00,294 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 102 states. [2022-04-08 10:08:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:00,295 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-04-08 10:08:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-04-08 10:08:00,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:00,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:00,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:00,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:08:00,296 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:08:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:00,296 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:08:00,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:00,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:08:01,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:08:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:01,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:01,464 INFO L499 BasicCegarLoop]: trace histogram [16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:01,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-04-08 10:08:01,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:01,668 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:01,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash -681899349, now seen corresponding path program 193 times [2022-04-08 10:08:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:01,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [55155273] [2022-04-08 10:08:01,670 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:01,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash -681899349, now seen corresponding path program 194 times [2022-04-08 10:08:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:01,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281497248] [2022-04-08 10:08:01,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:02,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:02,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {63701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {63675#true} is VALID [2022-04-08 10:08:02,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-08 10:08:02,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-08 10:08:02,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {63675#true} call ULTIMATE.init(); {63701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:02,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {63701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {63675#true} is VALID [2022-04-08 10:08:02,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-08 10:08:02,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-08 10:08:02,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {63675#true} call #t~ret9 := main(); {63675#true} is VALID [2022-04-08 10:08:02,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {63675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63680#(= main_~y~0 0)} is VALID [2022-04-08 10:08:02,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {63680#(= 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; {63681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:02,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {63681#(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; {63682#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:02,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {63682#(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; {63683#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:02,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {63683#(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; {63684#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:02,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {63684#(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; {63685#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:02,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {63685#(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; {63686#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:02,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {63686#(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; {63687#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:02,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {63687#(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; {63688#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:02,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {63688#(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; {63689#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:02,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {63689#(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; {63690#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:02,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {63690#(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; {63691#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:02,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {63691#(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; {63692#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:02,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {63692#(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; {63693#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:02,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {63693#(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; {63694#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:02,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {63694#(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; {63695#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:02,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {63695#(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; {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:02,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:02,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {63697#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:08:02,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {63697#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63698#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:08:02,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {63698#(and (<= main_~z~0 15) (<= 15 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; {63699#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:08:02,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {63699#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63700#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:02,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {63700#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {63676#false} is VALID [2022-04-08 10:08:02,051 INFO L272 TraceCheckUtils]: 28: Hoare triple {63676#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63676#false} is VALID [2022-04-08 10:08:02,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {63676#false} ~cond := #in~cond; {63676#false} is VALID [2022-04-08 10:08:02,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {63676#false} assume 0 == ~cond; {63676#false} is VALID [2022-04-08 10:08:02,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {63676#false} assume !false; {63676#false} is VALID [2022-04-08 10:08:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:02,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281497248] [2022-04-08 10:08:02,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281497248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:02,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624242575] [2022-04-08 10:08:02,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:02,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:02,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:02,052 INFO L229 MonitoredProcess]: Starting monitored process 116 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:02,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-04-08 10:08:02,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:02,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:02,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:08:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:02,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:02,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {63675#true} call ULTIMATE.init(); {63675#true} is VALID [2022-04-08 10:08:02,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {63675#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); {63675#true} is VALID [2022-04-08 10:08:02,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-08 10:08:02,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-08 10:08:02,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {63675#true} call #t~ret9 := main(); {63675#true} is VALID [2022-04-08 10:08:02,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {63675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63680#(= main_~y~0 0)} is VALID [2022-04-08 10:08:02,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {63680#(= 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; {63681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:02,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {63681#(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; {63682#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:02,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {63682#(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; {63683#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:02,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {63683#(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; {63684#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:02,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {63684#(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; {63685#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:02,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {63685#(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; {63686#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:02,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {63686#(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; {63687#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:02,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {63687#(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; {63688#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:02,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {63688#(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; {63689#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:02,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {63689#(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; {63690#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:02,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {63690#(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; {63691#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:02,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {63691#(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; {63692#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:02,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {63692#(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; {63693#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:02,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {63693#(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; {63694#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:02,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {63694#(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; {63695#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:02,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {63695#(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; {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:02,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:02,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {63696#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {63697#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:08:02,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {63697#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63698#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:08:02,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {63698#(and (<= main_~z~0 15) (<= 15 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; {63699#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:08:02,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {63699#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63783#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:02,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {63783#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {63676#false} is VALID [2022-04-08 10:08:02,427 INFO L272 TraceCheckUtils]: 28: Hoare triple {63676#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63676#false} is VALID [2022-04-08 10:08:02,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {63676#false} ~cond := #in~cond; {63676#false} is VALID [2022-04-08 10:08:02,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {63676#false} assume 0 == ~cond; {63676#false} is VALID [2022-04-08 10:08:02,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {63676#false} assume !false; {63676#false} is VALID [2022-04-08 10:08:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:02,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:03,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {63676#false} assume !false; {63676#false} is VALID [2022-04-08 10:08:03,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {63676#false} assume 0 == ~cond; {63676#false} is VALID [2022-04-08 10:08:03,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {63676#false} ~cond := #in~cond; {63676#false} is VALID [2022-04-08 10:08:03,079 INFO L272 TraceCheckUtils]: 28: Hoare triple {63676#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63676#false} is VALID [2022-04-08 10:08:03,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {63811#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {63676#false} is VALID [2022-04-08 10:08:03,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {63815#(< 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; {63811#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:03,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {63819#(< 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; {63815#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:03,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {63823#(< 0 (mod (+ main_~z~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; {63819#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:03,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {63827#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {63823#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:03,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {63827#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {63827#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:03,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {63834#(< 0 (mod (+ main_~y~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; {63827#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:03,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {63838#(< 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; {63834#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:03,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {63842#(< 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; {63838#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:03,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {63846#(< 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; {63842#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:03,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {63850#(< 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; {63846#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:03,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {63854#(< 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; {63850#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:03,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {63858#(< 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; {63854#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:03,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {63862#(< 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; {63858#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:03,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {63866#(< 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; {63862#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:03,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {63870#(< 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; {63866#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:03,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {63874#(< 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; {63870#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:03,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {63878#(< 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; {63874#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:03,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {63882#(< 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; {63878#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:03,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {63886#(< 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; {63882#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:03,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {63890#(< 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; {63886#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:03,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {63894#(< 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; {63890#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {63675#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63894#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:08:03,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {63675#true} call #t~ret9 := main(); {63675#true} is VALID [2022-04-08 10:08:03,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63675#true} {63675#true} #50#return; {63675#true} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {63675#true} assume true; {63675#true} is VALID [2022-04-08 10:08:03,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {63675#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); {63675#true} is VALID [2022-04-08 10:08:03,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {63675#true} call ULTIMATE.init(); {63675#true} is VALID [2022-04-08 10:08:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:03,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624242575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:03,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:03,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:08:03,092 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:03,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [55155273] [2022-04-08 10:08:03,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [55155273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:03,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:03,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:08:03,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672671438] [2022-04-08 10:08:03,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:03,093 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:03,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:03,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:03,111 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:08:03,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:08:03,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:08:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:08:03,111 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,887 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-04-08 10:08:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:08:07,887 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 82 transitions. [2022-04-08 10:08:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 82 transitions. [2022-04-08 10:08:07,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 82 transitions. [2022-04-08 10:08:07,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:07,942 INFO L225 Difference]: With dead ends: 112 [2022-04-08 10:08:07,942 INFO L226 Difference]: Without dead ends: 107 [2022-04-08 10:08:07,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=4223, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:08:07,942 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:07,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 127 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:08:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-08 10:08:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 52. [2022-04-08 10:08:08,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:08,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,371 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,371 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:08,371 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-04-08 10:08:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2022-04-08 10:08:08,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:08,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:08,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 107 states. [2022-04-08 10:08:08,372 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 107 states. [2022-04-08 10:08:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:08,373 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-04-08 10:08:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2022-04-08 10:08:08,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:08,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:08,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:08,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:08:08,373 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:08:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:08,373 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:08:08,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:08,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:08:09,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:08:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:09,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:09,565 INFO L499 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:09,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:09,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-04-08 10:08:09,781 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:09,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1620525300, now seen corresponding path program 195 times [2022-04-08 10:08:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:09,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855643963] [2022-04-08 10:08:09,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:09,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1620525300, now seen corresponding path program 196 times [2022-04-08 10:08:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:09,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320755360] [2022-04-08 10:08:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {64537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {64511#true} is VALID [2022-04-08 10:08:10,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-08 10:08:10,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-08 10:08:10,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {64511#true} call ULTIMATE.init(); {64537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:10,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {64537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {64511#true} is VALID [2022-04-08 10:08:10,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-08 10:08:10,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-08 10:08:10,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {64511#true} call #t~ret9 := main(); {64511#true} is VALID [2022-04-08 10:08:10,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {64511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64516#(= main_~y~0 0)} is VALID [2022-04-08 10:08:10,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {64516#(= 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; {64517#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:10,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {64517#(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; {64518#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:10,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {64518#(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; {64519#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:10,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {64519#(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; {64520#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:10,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {64520#(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; {64521#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:10,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {64521#(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; {64522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:10,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {64522#(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; {64523#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:10,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {64523#(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; {64524#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:10,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {64524#(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; {64525#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:10,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {64525#(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; {64526#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:10,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {64526#(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; {64527#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:10,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {64527#(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; {64528#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:10,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {64528#(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; {64529#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:10,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {64529#(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; {64530#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:10,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {64530#(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; {64531#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:10,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {64531#(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; {64532#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:10,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {64532#(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; {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:10,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:10,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {64534#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:08:10,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {64534#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64535#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:08:10,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {64535#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64536#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:08:10,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {64536#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {64512#false} is VALID [2022-04-08 10:08:10,128 INFO L272 TraceCheckUtils]: 28: Hoare triple {64512#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64512#false} is VALID [2022-04-08 10:08:10,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {64512#false} ~cond := #in~cond; {64512#false} is VALID [2022-04-08 10:08:10,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {64512#false} assume 0 == ~cond; {64512#false} is VALID [2022-04-08 10:08:10,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {64512#false} assume !false; {64512#false} is VALID [2022-04-08 10:08:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320755360] [2022-04-08 10:08:10,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320755360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702404903] [2022-04-08 10:08:10,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:10,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:10,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:10,130 INFO L229 MonitoredProcess]: Starting monitored process 117 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,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-04-08 10:08:10,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:10,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:10,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:08:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:10,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:10,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {64511#true} call ULTIMATE.init(); {64511#true} is VALID [2022-04-08 10:08:10,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {64511#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); {64511#true} is VALID [2022-04-08 10:08:10,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-08 10:08:10,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-08 10:08:10,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {64511#true} call #t~ret9 := main(); {64511#true} is VALID [2022-04-08 10:08:10,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {64511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64516#(= main_~y~0 0)} is VALID [2022-04-08 10:08:10,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {64516#(= 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; {64517#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:10,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {64517#(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; {64518#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:10,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {64518#(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; {64519#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:10,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {64519#(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; {64520#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:10,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {64520#(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; {64521#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:10,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {64521#(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; {64522#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:10,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {64522#(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; {64523#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:10,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {64523#(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; {64524#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:10,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {64524#(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; {64525#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:10,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {64525#(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; {64526#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:10,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {64526#(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; {64527#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:10,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {64527#(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; {64528#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:10,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {64528#(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; {64529#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:10,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {64529#(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; {64530#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:10,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {64530#(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; {64531#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:10,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {64531#(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; {64532#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:10,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {64532#(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; {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:10,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:10,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {64533#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {64534#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:08:10,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {64534#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64535#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:08:10,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {64535#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64619#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:08:10,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {64619#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {64512#false} is VALID [2022-04-08 10:08:10,518 INFO L272 TraceCheckUtils]: 28: Hoare triple {64512#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64512#false} is VALID [2022-04-08 10:08:10,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {64512#false} ~cond := #in~cond; {64512#false} is VALID [2022-04-08 10:08:10,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {64512#false} assume 0 == ~cond; {64512#false} is VALID [2022-04-08 10:08:10,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {64512#false} assume !false; {64512#false} is VALID [2022-04-08 10:08:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:10,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:11,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {64512#false} assume !false; {64512#false} is VALID [2022-04-08 10:08:11,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {64512#false} assume 0 == ~cond; {64512#false} is VALID [2022-04-08 10:08:11,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {64512#false} ~cond := #in~cond; {64512#false} is VALID [2022-04-08 10:08:11,259 INFO L272 TraceCheckUtils]: 28: Hoare triple {64512#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64512#false} is VALID [2022-04-08 10:08:11,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {64647#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64512#false} is VALID [2022-04-08 10:08:11,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {64651#(< 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; {64647#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:11,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {64655#(< 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; {64651#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:11,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {64659#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {64655#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:11,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {64659#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64659#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:11,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {64666#(< 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; {64659#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:11,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {64670#(< 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; {64666#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:11,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {64674#(< 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; {64670#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:11,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {64678#(< 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; {64674#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:11,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {64682#(< 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; {64678#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:11,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {64686#(< 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; {64682#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:11,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {64690#(< 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; {64686#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:11,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {64694#(< 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; {64690#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:11,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {64698#(< 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; {64694#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:11,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {64702#(< 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; {64698#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:11,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {64706#(< 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; {64702#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:11,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {64710#(< 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; {64706#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:11,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {64714#(< 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; {64710#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:11,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {64718#(< 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; {64714#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:11,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {64722#(< 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; {64718#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:11,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {64726#(< 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; {64722#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:08:11,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {64730#(< 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; {64726#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:08:11,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {64511#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64730#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:08:11,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {64511#true} call #t~ret9 := main(); {64511#true} is VALID [2022-04-08 10:08:11,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64511#true} {64511#true} #50#return; {64511#true} is VALID [2022-04-08 10:08:11,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {64511#true} assume true; {64511#true} is VALID [2022-04-08 10:08:11,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {64511#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); {64511#true} is VALID [2022-04-08 10:08:11,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {64511#true} call ULTIMATE.init(); {64511#true} is VALID [2022-04-08 10:08:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:11,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702404903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:11,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:11,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:08:11,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:11,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855643963] [2022-04-08 10:08:11,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855643963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:11,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:11,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:08:11,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347963519] [2022-04-08 10:08:11,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:11,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:11,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:11,324 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:08:11,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:08:11,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:11,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:08:11,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1645, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:08:11,325 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:16,112 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2022-04-08 10:08:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:08:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2022-04-08 10:08:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2022-04-08 10:08:16,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 84 transitions. [2022-04-08 10:08:16,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:16,163 INFO L225 Difference]: With dead ends: 116 [2022-04-08 10:08:16,163 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 10:08:16,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=986, Invalid=3844, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:08:16,164 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 63 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:16,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 137 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:08:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 10:08:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 52. [2022-04-08 10:08:16,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:16,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:16,647 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:16,647 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:16,648 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2022-04-08 10:08:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-04-08 10:08:16,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:16,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:16,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 111 states. [2022-04-08 10:08:16,648 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 111 states. [2022-04-08 10:08:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:16,649 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2022-04-08 10:08:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2022-04-08 10:08:16,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:16,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:16,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:16,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:08:16,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:08:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:16,650 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:08:16,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:16,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:08:17,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:08:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:17,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:17,855 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:17,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2022-04-08 10:08:18,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:18,062 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2089974411, now seen corresponding path program 197 times [2022-04-08 10:08:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:18,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1345754940] [2022-04-08 10:08:18,065 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:18,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:18,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2089974411, now seen corresponding path program 198 times [2022-04-08 10:08:18,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:18,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530342100] [2022-04-08 10:08:18,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:18,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {65383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {65357#true} is VALID [2022-04-08 10:08:18,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-08 10:08:18,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-08 10:08:18,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {65357#true} call ULTIMATE.init(); {65383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:18,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {65383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {65357#true} is VALID [2022-04-08 10:08:18,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-08 10:08:18,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-08 10:08:18,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {65357#true} call #t~ret9 := main(); {65357#true} is VALID [2022-04-08 10:08:18,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {65357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65362#(= main_~y~0 0)} is VALID [2022-04-08 10:08:18,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {65362#(= 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; {65363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:18,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {65363#(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; {65364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:18,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {65364#(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; {65365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:18,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {65365#(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; {65366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:18,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {65366#(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; {65367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:18,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {65367#(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; {65368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:18,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {65368#(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; {65369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:18,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {65369#(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; {65370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:18,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {65370#(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; {65371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:18,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {65371#(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; {65372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:18,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {65372#(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; {65373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:18,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {65373#(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; {65374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:18,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {65374#(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; {65375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:18,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {65375#(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; {65376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:18,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {65376#(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; {65377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:18,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {65377#(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; {65378#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:18,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {65378#(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; {65379#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:18,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {65379#(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; {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:18,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:18,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {65381#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:08:18,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {65381#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65382#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:08:18,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {65382#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {65358#false} is VALID [2022-04-08 10:08:18,428 INFO L272 TraceCheckUtils]: 28: Hoare triple {65358#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65358#false} is VALID [2022-04-08 10:08:18,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {65358#false} ~cond := #in~cond; {65358#false} is VALID [2022-04-08 10:08:18,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {65358#false} assume 0 == ~cond; {65358#false} is VALID [2022-04-08 10:08:18,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {65358#false} assume !false; {65358#false} is VALID [2022-04-08 10:08:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:18,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530342100] [2022-04-08 10:08:18,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530342100] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:18,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988543213] [2022-04-08 10:08:18,429 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:18,430 INFO L229 MonitoredProcess]: Starting monitored process 118 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:18,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-04-08 10:08:18,759 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:08:18,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:18,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:08:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:18,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:19,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {65357#true} call ULTIMATE.init(); {65357#true} is VALID [2022-04-08 10:08:19,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {65357#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); {65357#true} is VALID [2022-04-08 10:08:19,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-08 10:08:19,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-08 10:08:19,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {65357#true} call #t~ret9 := main(); {65357#true} is VALID [2022-04-08 10:08:19,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {65357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65362#(= main_~y~0 0)} is VALID [2022-04-08 10:08:19,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {65362#(= 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; {65363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:19,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {65363#(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; {65364#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:19,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {65364#(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; {65365#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:19,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {65365#(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; {65366#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:19,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {65366#(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; {65367#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:19,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {65367#(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; {65368#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:19,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {65368#(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; {65369#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:19,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {65369#(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; {65370#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:19,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {65370#(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; {65371#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:19,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {65371#(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; {65372#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:19,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {65372#(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; {65373#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:19,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {65373#(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; {65374#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:19,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {65374#(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; {65375#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:19,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {65375#(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; {65376#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:19,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {65376#(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; {65377#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:19,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {65377#(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; {65378#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:19,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {65378#(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; {65379#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:19,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {65379#(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; {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {65380#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {65381#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:08:19,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {65381#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65465#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:08:19,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {65465#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {65358#false} is VALID [2022-04-08 10:08:19,069 INFO L272 TraceCheckUtils]: 28: Hoare triple {65358#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65358#false} is VALID [2022-04-08 10:08:19,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {65358#false} ~cond := #in~cond; {65358#false} is VALID [2022-04-08 10:08:19,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {65358#false} assume 0 == ~cond; {65358#false} is VALID [2022-04-08 10:08:19,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {65358#false} assume !false; {65358#false} is VALID [2022-04-08 10:08:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:19,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:19,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {65358#false} assume !false; {65358#false} is VALID [2022-04-08 10:08:19,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {65358#false} assume 0 == ~cond; {65358#false} is VALID [2022-04-08 10:08:19,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {65358#false} ~cond := #in~cond; {65358#false} is VALID [2022-04-08 10:08:19,817 INFO L272 TraceCheckUtils]: 28: Hoare triple {65358#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65358#false} is VALID [2022-04-08 10:08:19,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {65493#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {65358#false} is VALID [2022-04-08 10:08:19,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {65497#(< 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; {65493#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:19,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {65501#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {65497#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:19,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {65501#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {65501#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:19,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {65508#(< 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; {65501#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:19,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {65512#(< 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; {65508#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:19,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {65516#(< 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; {65512#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:19,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {65520#(< 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; {65516#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:19,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {65524#(< 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; {65520#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:19,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {65528#(< 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; {65524#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:19,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {65532#(< 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; {65528#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:19,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {65536#(< 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; {65532#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:19,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {65540#(< 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; {65536#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:19,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {65544#(< 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; {65540#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:19,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {65548#(< 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; {65544#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:19,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {65552#(< 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; {65548#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:19,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {65556#(< 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; {65552#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:19,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {65560#(< 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; {65556#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:19,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {65564#(< 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; {65560#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:08:19,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {65568#(< 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; {65564#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:08:19,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {65572#(< 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; {65568#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:08:19,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {65576#(< 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; {65572#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:08:19,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {65357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65576#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:08:19,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {65357#true} call #t~ret9 := main(); {65357#true} is VALID [2022-04-08 10:08:19,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65357#true} {65357#true} #50#return; {65357#true} is VALID [2022-04-08 10:08:19,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {65357#true} assume true; {65357#true} is VALID [2022-04-08 10:08:19,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {65357#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); {65357#true} is VALID [2022-04-08 10:08:19,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {65357#true} call ULTIMATE.init(); {65357#true} is VALID [2022-04-08 10:08:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:19,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988543213] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:19,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:19,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:08:19,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:19,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1345754940] [2022-04-08 10:08:19,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1345754940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:19,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:19,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:08:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672720841] [2022-04-08 10:08:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:19,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:19,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:19,852 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:08:19,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:08:19,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:19,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:08:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=1614, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:08:19,853 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:25,173 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2022-04-08 10:08:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:08:25,173 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 87 transitions. [2022-04-08 10:08:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 87 transitions. [2022-04-08 10:08:25,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 87 transitions. [2022-04-08 10:08:25,221 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:25,221 INFO L225 Difference]: With dead ends: 119 [2022-04-08 10:08:25,221 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 10:08:25,222 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=974, Invalid=3582, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:08:25,222 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:25,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 152 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:08:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 10:08:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 52. [2022-04-08 10:08:25,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:25,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:25,657 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:25,657 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:25,658 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2022-04-08 10:08:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-04-08 10:08:25,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:25,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:25,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 114 states. [2022-04-08 10:08:25,659 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 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 114 states. [2022-04-08 10:08:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:25,660 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2022-04-08 10:08:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-04-08 10:08:25,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:25,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:25,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:25,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call 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:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-04-08 10:08:25,660 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 32 [2022-04-08 10:08:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:25,660 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-04-08 10:08:25,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:25,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 62 transitions. [2022-04-08 10:08:27,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-04-08 10:08:27,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:08:27,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:27,413 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:27,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2022-04-08 10:08:27,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:27,617 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -7089364, now seen corresponding path program 37 times [2022-04-08 10:08:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:27,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538449515] [2022-04-08 10:08:27,620 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:27,620 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash -7089364, now seen corresponding path program 38 times [2022-04-08 10:08:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:27,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43480445] [2022-04-08 10:08:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:27,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:27,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:27,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {66237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {66211#true} is VALID [2022-04-08 10:08:27,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-08 10:08:27,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-08 10:08:27,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {66211#true} call ULTIMATE.init(); {66237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:27,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {66237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {66211#true} is VALID [2022-04-08 10:08:27,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-08 10:08:27,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-08 10:08:27,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#true} call #t~ret9 := main(); {66211#true} is VALID [2022-04-08 10:08:27,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {66211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66216#(= main_~y~0 0)} is VALID [2022-04-08 10:08:27,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {66216#(= 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; {66217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:27,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {66217#(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; {66218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:27,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {66218#(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; {66219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:27,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {66219#(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; {66220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:27,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {66220#(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; {66221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:27,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {66221#(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; {66222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:27,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {66222#(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; {66223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:27,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {66223#(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; {66224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:27,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {66224#(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; {66225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:27,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {66225#(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; {66226#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:27,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {66226#(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; {66227#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:27,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {66227#(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; {66228#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:27,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {66228#(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; {66229#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:27,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {66229#(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; {66230#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:27,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {66230#(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; {66231#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:27,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {66231#(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; {66232#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:27,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {66232#(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; {66233#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:27,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {66233#(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; {66234#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:27,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {66234#(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; {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:27,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:27,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {66236#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:27,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {66236#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {66212#false} is VALID [2022-04-08 10:08:27,897 INFO L272 TraceCheckUtils]: 28: Hoare triple {66212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66212#false} is VALID [2022-04-08 10:08:27,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {66212#false} ~cond := #in~cond; {66212#false} is VALID [2022-04-08 10:08:27,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {66212#false} assume 0 == ~cond; {66212#false} is VALID [2022-04-08 10:08:27,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {66212#false} assume !false; {66212#false} is VALID [2022-04-08 10:08:27,897 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:08:27,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:27,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43480445] [2022-04-08 10:08:27,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43480445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:27,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389446387] [2022-04-08 10:08:27,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:27,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:27,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:27,899 INFO L229 MonitoredProcess]: Starting monitored process 119 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:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-04-08 10:08:27,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:27,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:27,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:08:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:27,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:28,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {66211#true} call ULTIMATE.init(); {66211#true} is VALID [2022-04-08 10:08:28,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {66211#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); {66211#true} is VALID [2022-04-08 10:08:28,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-08 10:08:28,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-08 10:08:28,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#true} call #t~ret9 := main(); {66211#true} is VALID [2022-04-08 10:08:28,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {66211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66216#(= main_~y~0 0)} is VALID [2022-04-08 10:08:28,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {66216#(= 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; {66217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:28,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {66217#(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; {66218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:28,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {66218#(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; {66219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:28,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {66219#(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; {66220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:28,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {66220#(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; {66221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:28,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {66221#(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; {66222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:28,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {66222#(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; {66223#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:28,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {66223#(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; {66224#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:28,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {66224#(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; {66225#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:28,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {66225#(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; {66226#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:28,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {66226#(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; {66227#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:28,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {66227#(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; {66228#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:28,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {66228#(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; {66229#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:28,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {66229#(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; {66230#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:28,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {66230#(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; {66231#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:28,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {66231#(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; {66232#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:28,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {66232#(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; {66233#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:28,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {66233#(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; {66234#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:28,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {66234#(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; {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:28,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:28,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {66235#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {66319#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:08:28,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {66319#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {66212#false} is VALID [2022-04-08 10:08:28,150 INFO L272 TraceCheckUtils]: 28: Hoare triple {66212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66212#false} is VALID [2022-04-08 10:08:28,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {66212#false} ~cond := #in~cond; {66212#false} is VALID [2022-04-08 10:08:28,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {66212#false} assume 0 == ~cond; {66212#false} is VALID [2022-04-08 10:08:28,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {66212#false} assume !false; {66212#false} is VALID [2022-04-08 10:08:28,150 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:08:28,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:28,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {66212#false} assume !false; {66212#false} is VALID [2022-04-08 10:08:28,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {66212#false} assume 0 == ~cond; {66212#false} is VALID [2022-04-08 10:08:28,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {66212#false} ~cond := #in~cond; {66212#false} is VALID [2022-04-08 10:08:28,735 INFO L272 TraceCheckUtils]: 28: Hoare triple {66212#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66212#false} is VALID [2022-04-08 10:08:28,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {66347#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66212#false} is VALID [2022-04-08 10:08:28,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {66351#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {66347#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:28,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {66351#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {66351#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:28,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {66358#(< 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; {66351#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:28,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {66362#(< 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; {66358#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:28,738 INFO L290 TraceCheckUtils]: 22: Hoare triple {66366#(< 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; {66362#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:28,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {66370#(< 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; {66366#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:28,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {66374#(< 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; {66370#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:28,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {66378#(< 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; {66374#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:28,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {66382#(< 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; {66378#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:28,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {66386#(< 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; {66382#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:28,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {66390#(< 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; {66386#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:28,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {66394#(< 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; {66390#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:28,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {66398#(< 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; {66394#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:08:28,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {66402#(< 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; {66398#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:08:28,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {66406#(< 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; {66402#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:08:28,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {66410#(< 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; {66406#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:08:28,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {66414#(< 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; {66410#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:08:28,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {66418#(< 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; {66414#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:08:28,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {66422#(< 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; {66418#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:08:28,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {66426#(< 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; {66422#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:08:28,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {66430#(< 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; {66426#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:08:28,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {66211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66430#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:28,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {66211#true} call #t~ret9 := main(); {66211#true} is VALID [2022-04-08 10:08:28,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66211#true} {66211#true} #50#return; {66211#true} is VALID [2022-04-08 10:08:28,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {66211#true} assume true; {66211#true} is VALID [2022-04-08 10:08:28,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {66211#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); {66211#true} is VALID [2022-04-08 10:08:28,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {66211#true} call ULTIMATE.init(); {66211#true} is VALID [2022-04-08 10:08:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:28,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389446387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:28,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:28,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:08:28,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:28,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538449515] [2022-04-08 10:08:28,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538449515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:28,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:28,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:08:28,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809846493] [2022-04-08 10:08:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:28,750 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:28,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:28,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:28,763 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:08:28,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:08:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:28,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:08:28,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:08:28,764 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:32,975 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2022-04-08 10:08:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:08:32,975 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-08 10:08:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-08 10:08:32,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 91 transitions. [2022-04-08 10:08:33,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:33,029 INFO L225 Difference]: With dead ends: 124 [2022-04-08 10:08:33,029 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 10:08:33,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:08:33,030 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:33,030 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 155 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:08:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 10:08:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 54. [2022-04-08 10:08:33,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:33,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:33,460 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:33,460 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:33,461 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2022-04-08 10:08:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-04-08 10:08:33,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:33,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:33,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 3 states have call successors, (3), 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 119 states. [2022-04-08 10:08:33,462 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 3 states have call successors, (3), 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 119 states. [2022-04-08 10:08:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:33,463 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2022-04-08 10:08:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-04-08 10:08:33,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:33,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:33,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:33,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call 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:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-08 10:08:33,464 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-08 10:08:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:33,464 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-08 10:08:33,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 23 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:08:33,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-08 10:08:34,661 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:08:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-08 10:08:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:08:34,662 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:34,662 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:34,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2022-04-08 10:08:34,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2022-04-08 10:08:34,867 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:34,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash -736612169, now seen corresponding path program 199 times [2022-04-08 10:08:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:34,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057984723] [2022-04-08 10:08:34,869 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:34,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -736612169, now seen corresponding path program 200 times [2022-04-08 10:08:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:34,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452747078] [2022-04-08 10:08:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:35,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:35,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {67116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {67087#true} is VALID [2022-04-08 10:08:35,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-08 10:08:35,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-08 10:08:35,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {67087#true} call ULTIMATE.init(); {67116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:35,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {67116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {67087#true} is VALID [2022-04-08 10:08:35,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-08 10:08:35,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-08 10:08:35,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {67087#true} call #t~ret9 := main(); {67087#true} is VALID [2022-04-08 10:08:35,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {67087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:35,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67093#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~0 1)))} is VALID [2022-04-08 10:08:35,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {67093#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~n~0 (+ main_~x~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; {67094#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:08:35,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {67094#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293)) (<= main_~n~0 (+ main_~x~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; {67095#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:08:35,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {67095#(and (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~x~0 3)) (<= 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; {67096#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:08:35,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {67096#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67097#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:08:35,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {67097#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ 5 main_~x~0)) (<= 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; {67098#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:08:35,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {67098#(and (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ main_~x~0 6)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67099#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} is VALID [2022-04-08 10:08:35,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {67099#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~n~0 (+ 7 main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67100#(and (<= main_~n~0 (+ main_~x~0 8)) (<= (+ main_~x~0 8) main_~n~0) (<= main_~n~0 (+ 4294967295 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:08:35,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {67100#(and (<= main_~n~0 (+ main_~x~0 8)) (<= (+ main_~x~0 8) main_~n~0) (<= main_~n~0 (+ 4294967295 (* 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; {67101#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~x~0 (+ 4294967286 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-08 10:08:35,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {67101#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~n~0 (+ main_~x~0 9)) (<= main_~x~0 (+ 4294967286 (* 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; {67102#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* (div (+ 4294967305 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 10)))} is VALID [2022-04-08 10:08:35,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {67102#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (* (div (+ 4294967305 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 10)))} assume !(~x~0 % 4294967296 > 0); {67103#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967305 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 10)))} is VALID [2022-04-08 10:08:35,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {67103#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967305 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 10)))} ~z~0 := ~y~0; {67103#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967305 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 10)))} is VALID [2022-04-08 10:08:35,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {67103#(and (<= main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (* (div (+ 4294967305 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~x~0) (<= main_~n~0 (+ main_~x~0 10)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67104#(and (<= main_~n~0 (+ main_~x~0 9)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-08 10:08:35,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {67104#(and (<= main_~n~0 (+ main_~x~0 9)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967304) 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; {67105#(and (<= main_~n~0 (+ main_~x~0 8)) (<= (+ 2 (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~x~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:35,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {67105#(and (<= main_~n~0 (+ main_~x~0 8)) (<= (+ 2 (* (div (+ 4294967303 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= main_~x~0 (+ 2 (* (div main_~n~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; {67106#(and (<= (+ 3 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:08:35,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {67106#(and (<= (+ 3 (* 4294967296 (div (+ 4294967302 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296))) main_~x~0) (<= main_~n~0 (+ 7 main_~x~0)) (<= main_~x~0 (+ 3 (* (div main_~n~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; {67107#(and (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ 4 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0))} is VALID [2022-04-08 10:08:35,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {67107#(and (<= main_~n~0 (+ main_~x~0 6)) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ 4 (* (div (+ main_~x~0 4294967301 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {67108#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 main_~x~0)))} is VALID [2022-04-08 10:08:35,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {67108#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967300 (* (- 1) main_~n~0)) 4294967296) 4294967296) 5) main_~x~0) (<= main_~x~0 (+ 5 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ 5 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; {67109#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 6) main_~x~0))} is VALID [2022-04-08 10:08:35,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {67109#(and (<= main_~n~0 (+ main_~x~0 4)) (<= main_~x~0 (+ 6 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) 6) 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; {67110#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 7) main_~x~0) (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)))} is VALID [2022-04-08 10:08:35,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {67110#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 7) main_~x~0) (<= main_~x~0 (+ 7 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67111#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 8) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 8)) (<= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:08:35,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {67111#(and (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 8) main_~x~0) (<= main_~x~0 (+ (* (div main_~n~0 4294967296) 4294967296) 8)) (<= main_~n~0 (+ main_~x~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; {67112#(and (<= main_~x~0 (+ 9 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 9) main_~x~0))} is VALID [2022-04-08 10:08:35,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {67112#(and (<= main_~x~0 (+ 9 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~n~0 (+ main_~x~0 1)) (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 9) 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; {67113#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:35,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {67113#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {67113#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-08 10:08:35,880 INFO L272 TraceCheckUtils]: 29: Hoare triple {67113#(and (<= (div main_~x~0 4294967296) (div main_~n~0 4294967296)) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67114#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:08:35,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {67114#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {67115#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:08:35,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {67115#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {67088#false} is VALID [2022-04-08 10:08:35,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {67088#false} assume !false; {67088#false} is VALID [2022-04-08 10:08:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:35,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:35,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452747078] [2022-04-08 10:08:35,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452747078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:35,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235265618] [2022-04-08 10:08:35,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:35,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:35,882 INFO L229 MonitoredProcess]: Starting monitored process 120 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:35,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-04-08 10:08:35,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:35,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:35,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:08:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:35,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:36,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {67087#true} call ULTIMATE.init(); {67087#true} is VALID [2022-04-08 10:08:36,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {67087#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); {67087#true} is VALID [2022-04-08 10:08:36,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-08 10:08:36,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-08 10:08:36,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {67087#true} call #t~ret9 := main(); {67087#true} is VALID [2022-04-08 10:08:36,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {67087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:36,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67138#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:08:36,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {67138#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67142#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:08:36,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {67142#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67146#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:08:36,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {67146#(= (+ (- 1) main_~n~0) (+ main_~x~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; {67150#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:08:36,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {67150#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {67154#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-08 10:08:36,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {67154#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {67158#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:08:36,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {67158#(= (+ main_~x~0 1) (+ main_~n~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; {67162#(= (+ main_~x~0 1) (+ main_~n~0 (- 6)))} is VALID [2022-04-08 10:08:36,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {67162#(= (+ main_~x~0 1) (+ main_~n~0 (- 6)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67166#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} is VALID [2022-04-08 10:08:36,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {67166#(= (+ main_~x~0 1) (+ main_~n~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; {67170#(= (+ main_~x~0 2) (+ main_~n~0 (- 7)))} is VALID [2022-04-08 10:08:36,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {67170#(= (+ main_~x~0 2) (+ main_~n~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; {67174#(= (+ (- 9) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:08:36,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {67174#(= (+ (- 9) main_~n~0) (+ main_~x~0 1))} assume !(~x~0 % 4294967296 > 0); {67174#(= (+ (- 9) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:08:36,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {67174#(= (+ (- 9) main_~n~0) (+ main_~x~0 1))} ~z~0 := ~y~0; {67174#(= (+ (- 9) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:08:36,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {67174#(= (+ (- 9) main_~n~0) (+ main_~x~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; {67170#(= (+ main_~x~0 2) (+ main_~n~0 (- 7)))} is VALID [2022-04-08 10:08:36,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {67170#(= (+ main_~x~0 2) (+ main_~n~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67166#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} is VALID [2022-04-08 10:08:36,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {67166#(= (+ main_~x~0 1) (+ main_~n~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67162#(= (+ main_~x~0 1) (+ main_~n~0 (- 6)))} is VALID [2022-04-08 10:08:36,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {67162#(= (+ main_~x~0 1) (+ main_~n~0 (- 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67158#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} is VALID [2022-04-08 10:08:36,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {67158#(= (+ main_~x~0 1) (+ main_~n~0 (- 5)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67154#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-08 10:08:36,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {67154#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {67150#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:08:36,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {67150#(= (+ main_~n~0 (- 3)) (+ main_~x~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; {67146#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:08:36,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {67146#(= (+ (- 1) main_~n~0) (+ main_~x~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; {67142#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:08:36,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {67142#(= (+ main_~x~0 1) (+ (- 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; {67138#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0)} is VALID [2022-04-08 10:08:36,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {67138#(= (+ main_~x~0 (* (- 1) main_~n~0) 1) 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; {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:36,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-08 10:08:36,384 INFO L272 TraceCheckUtils]: 29: Hoare triple {67092#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:36,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {67217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:36,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {67221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67088#false} is VALID [2022-04-08 10:08:36,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {67088#false} assume !false; {67088#false} is VALID [2022-04-08 10:08:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:36,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:36,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {67088#false} assume !false; {67088#false} is VALID [2022-04-08 10:08:36,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {67221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67088#false} is VALID [2022-04-08 10:08:36,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {67217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:08:36,944 INFO L272 TraceCheckUtils]: 29: Hoare triple {67237#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:08:36,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {67237#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67237#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:36,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {67244#(= (mod main_~n~0 4294967296) (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; {67237#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:36,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {67248#(= (mod main_~n~0 4294967296) (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; {67244#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:36,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {67252#(= (mod (+ main_~x~0 3) 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; {67248#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:36,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {67256#(= (mod main_~n~0 4294967296) (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; {67252#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:08:36,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {67260#(= (mod main_~n~0 4294967296) (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; {67256#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:36,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {67264#(= (mod main_~n~0 4294967296) (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; {67260#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:36,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {67268#(= (mod main_~n~0 4294967296) (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; {67264#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:08:36,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {67272#(= (mod main_~n~0 4294967296) (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; {67268#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:36,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {67276#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 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; {67272#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:08:36,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {67280#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 10) 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; {67276#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:08:36,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {67280#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 10) 4294967296))} ~z~0 := ~y~0; {67280#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 10) 4294967296))} is VALID [2022-04-08 10:08:36,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {67280#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 10) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67280#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 10) 4294967296))} is VALID [2022-04-08 10:08:36,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {67276#(= (mod main_~n~0 4294967296) (mod (+ main_~x~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; {67280#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 10) 4294967296))} is VALID [2022-04-08 10:08:36,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {67272#(= (mod main_~n~0 4294967296) (mod (+ main_~x~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; {67276#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 9) 4294967296))} is VALID [2022-04-08 10:08:36,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {67268#(= (mod main_~n~0 4294967296) (mod (+ 7 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; {67272#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 8) 4294967296))} is VALID [2022-04-08 10:08:36,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {67264#(= (mod main_~n~0 4294967296) (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; {67268#(= (mod main_~n~0 4294967296) (mod (+ 7 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:36,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {67260#(= (mod main_~n~0 4294967296) (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; {67264#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-08 10:08:36,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {67256#(= (mod main_~n~0 4294967296) (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; {67260#(= (mod main_~n~0 4294967296) (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-08 10:08:36,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {67252#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~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; {67256#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-08 10:08:36,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {67248#(= (mod main_~n~0 4294967296) (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; {67252#(= (mod (+ main_~x~0 3) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-08 10:08:36,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {67244#(= (mod main_~n~0 4294967296) (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; {67248#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-08 10:08:36,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {67237#(= (mod main_~n~0 4294967296) (mod 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; {67244#(= (mod main_~n~0 4294967296) (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-08 10:08:36,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {67087#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67237#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:08:36,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {67087#true} call #t~ret9 := main(); {67087#true} is VALID [2022-04-08 10:08:36,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67087#true} {67087#true} #50#return; {67087#true} is VALID [2022-04-08 10:08:36,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {67087#true} assume true; {67087#true} is VALID [2022-04-08 10:08:36,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {67087#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); {67087#true} is VALID [2022-04-08 10:08:36,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {67087#true} call ULTIMATE.init(); {67087#true} is VALID [2022-04-08 10:08:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:36,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235265618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:36,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:36,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 50 [2022-04-08 10:08:36,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057984723] [2022-04-08 10:08:36,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057984723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:36,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:36,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:08:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401707037] [2022-04-08 10:08:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:36,960 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:08:36,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:36,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:36,990 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:08:36,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:08:36,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:08:36,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2288, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:08:36,991 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:40,938 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-08 10:08:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:08:40,938 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-08 10:08:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 44 transitions. [2022-04-08 10:08:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 44 transitions. [2022-04-08 10:08:40,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 44 transitions. [2022-04-08 10:08:40,992 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:08:40,993 INFO L225 Difference]: With dead ends: 69 [2022-04-08 10:08:40,993 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 10:08:40,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=4938, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:08:40,993 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:40,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:08:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 10:08:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-08 10:08:41,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:41,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,510 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,510 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:41,510 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 10:08:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 10:08:41,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:41,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:41,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 64 states. [2022-04-08 10:08:41,511 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 64 states. [2022-04-08 10:08:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:41,511 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-08 10:08:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-08 10:08:41,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:41,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:41,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:41,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:08:41,512 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:08:41,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:41,512 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:08:41,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:08:41,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:08:42,978 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:08:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:08:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:08:42,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:42,980 INFO L499 BasicCegarLoop]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:42,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:43,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:43,193 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash 55180598, now seen corresponding path program 201 times [2022-04-08 10:08:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325662780] [2022-04-08 10:08:43,196 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:43,196 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash 55180598, now seen corresponding path program 202 times [2022-04-08 10:08:43,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:43,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774689580] [2022-04-08 10:08:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:43,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {67786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {67759#true} is VALID [2022-04-08 10:08:43,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-08 10:08:43,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-08 10:08:43,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {67759#true} call ULTIMATE.init(); {67786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:43,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {67786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {67759#true} is VALID [2022-04-08 10:08:43,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-08 10:08:43,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-08 10:08:43,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {67759#true} call #t~ret9 := main(); {67759#true} is VALID [2022-04-08 10:08:43,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {67759#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67764#(= main_~y~0 0)} is VALID [2022-04-08 10:08:43,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {67764#(= 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; {67765#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:43,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {67765#(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; {67766#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:43,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {67766#(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; {67767#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:43,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {67767#(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; {67768#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:43,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {67768#(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; {67769#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:43,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {67769#(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; {67770#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:43,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {67770#(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; {67771#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:43,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {67771#(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; {67772#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:43,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {67772#(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; {67773#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:43,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {67773#(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; {67774#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:43,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {67774#(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; {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:43,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:43,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {67776#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:43,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {67776#(and (<= main_~z~0 11) (<= 11 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; {67777#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:43,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {67777#(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; {67778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:43,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {67778#(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; {67779#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:43,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {67779#(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; {67780#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:43,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {67780#(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; {67781#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:43,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {67781#(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; {67782#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:43,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {67782#(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; {67783#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:43,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {67783#(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; {67784#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:43,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {67784#(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; {67785#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:43,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {67785#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67760#false} is VALID [2022-04-08 10:08:43,602 INFO L272 TraceCheckUtils]: 29: Hoare triple {67760#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67760#false} is VALID [2022-04-08 10:08:43,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {67760#false} ~cond := #in~cond; {67760#false} is VALID [2022-04-08 10:08:43,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {67760#false} assume 0 == ~cond; {67760#false} is VALID [2022-04-08 10:08:43,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {67760#false} assume !false; {67760#false} is VALID [2022-04-08 10:08:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:43,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:43,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774689580] [2022-04-08 10:08:43,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774689580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:43,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596533445] [2022-04-08 10:08:43,603 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:43,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:43,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:43,604 INFO L229 MonitoredProcess]: Starting monitored process 121 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:43,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-04-08 10:08:43,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:43,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:43,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:08:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:43,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:43,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {67759#true} call ULTIMATE.init(); {67759#true} is VALID [2022-04-08 10:08:43,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {67759#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); {67759#true} is VALID [2022-04-08 10:08:43,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-08 10:08:43,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-08 10:08:43,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {67759#true} call #t~ret9 := main(); {67759#true} is VALID [2022-04-08 10:08:43,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {67759#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67764#(= main_~y~0 0)} is VALID [2022-04-08 10:08:43,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {67764#(= 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; {67765#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:43,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {67765#(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; {67766#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:43,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {67766#(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; {67767#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:43,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {67767#(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; {67768#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:43,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {67768#(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; {67769#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:43,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {67769#(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; {67770#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:43,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {67770#(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; {67771#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:43,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {67771#(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; {67772#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:43,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {67772#(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; {67773#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:43,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {67773#(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; {67774#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:43,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {67774#(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; {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:43,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:43,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {67775#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {67776#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:43,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {67776#(and (<= main_~z~0 11) (<= 11 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; {67777#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:43,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {67777#(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; {67778#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:43,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {67778#(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; {67779#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:43,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {67779#(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; {67780#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:43,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {67780#(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; {67781#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:43,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {67781#(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; {67782#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:43,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {67782#(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; {67783#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:43,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {67783#(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; {67784#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:43,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {67784#(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; {67871#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:43,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {67871#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {67760#false} is VALID [2022-04-08 10:08:43,870 INFO L272 TraceCheckUtils]: 29: Hoare triple {67760#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67760#false} is VALID [2022-04-08 10:08:43,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {67760#false} ~cond := #in~cond; {67760#false} is VALID [2022-04-08 10:08:43,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {67760#false} assume 0 == ~cond; {67760#false} is VALID [2022-04-08 10:08:43,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {67760#false} assume !false; {67760#false} is VALID [2022-04-08 10:08:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:43,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:44,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {67760#false} assume !false; {67760#false} is VALID [2022-04-08 10:08:44,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {67760#false} assume 0 == ~cond; {67760#false} is VALID [2022-04-08 10:08:44,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {67760#false} ~cond := #in~cond; {67760#false} is VALID [2022-04-08 10:08:44,421 INFO L272 TraceCheckUtils]: 29: Hoare triple {67760#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67760#false} is VALID [2022-04-08 10:08:44,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {67899#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {67760#false} is VALID [2022-04-08 10:08:44,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {67903#(< 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; {67899#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:44,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {67907#(< 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; {67903#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:44,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {67911#(< 0 (mod (+ main_~z~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; {67907#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:44,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {67915#(< 0 (mod (+ 4294967292 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; {67911#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:44,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {67919#(< 0 (mod (+ 4294967291 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; {67915#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:44,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {67923#(< 0 (mod (+ 4294967290 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; {67919#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:44,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {67927#(< 0 (mod (+ main_~z~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; {67923#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:44,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {67931#(< 0 (mod (+ 4294967288 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; {67927#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:44,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {67935#(< 0 (mod (+ main_~z~0 4294967287) 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; {67931#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:44,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {67939#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {67935#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:08:44,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {67939#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67939#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:08:44,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {67946#(< 0 (mod (+ 4294967288 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; {67939#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:08:44,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {67950#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67946#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:44,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {67954#(< 0 (mod (+ 4294967290 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; {67950#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:44,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {67958#(< 0 (mod (+ 4294967291 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; {67954#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:44,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {67962#(< 0 (mod (+ 4294967292 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; {67958#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:44,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {67966#(< 0 (mod (+ main_~y~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; {67962#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:44,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {67970#(< 0 (mod (+ main_~y~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; {67966#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:44,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {67974#(< 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; {67970#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:44,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {67978#(< 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; {67974#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:44,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {67982#(< 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; {67978#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:44,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {67986#(< 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; {67982#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:44,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {67759#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67986#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:44,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {67759#true} call #t~ret9 := main(); {67759#true} is VALID [2022-04-08 10:08:44,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67759#true} {67759#true} #50#return; {67759#true} is VALID [2022-04-08 10:08:44,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {67759#true} assume true; {67759#true} is VALID [2022-04-08 10:08:44,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {67759#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); {67759#true} is VALID [2022-04-08 10:08:44,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {67759#true} call ULTIMATE.init(); {67759#true} is VALID [2022-04-08 10:08:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:44,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596533445] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:44,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:44,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:08:44,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325662780] [2022-04-08 10:08:44,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325662780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:44,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:44,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:08:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910388574] [2022-04-08 10:08:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:44,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:44,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:44,454 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:08:44,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:08:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:08:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:08:44,455 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:47,215 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-08 10:08:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:08:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-08 10:08:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2022-04-08 10:08:47,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 61 transitions. [2022-04-08 10:08:47,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:47,269 INFO L225 Difference]: With dead ends: 82 [2022-04-08 10:08:47,269 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 10:08:47,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1049, Invalid=5113, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 10:08:47,270 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:47,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:08:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 10:08:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2022-04-08 10:08:47,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:47,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:47,933 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:47,934 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:47,934 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-08 10:08:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-08 10:08:47,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:47,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:47,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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:08:47,935 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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:08:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:47,935 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-08 10:08:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-08 10:08:47,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:47,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:47,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:47,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:08:47,936 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:08:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:47,936 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:08:47,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:47,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:08:49,463 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:08:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:08:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:08:49,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:49,464 INFO L499 BasicCegarLoop]: trace histogram [12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:49,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:49,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:49,680 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:49,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1166203689, now seen corresponding path program 203 times [2022-04-08 10:08:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:49,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718168533] [2022-04-08 10:08:49,682 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:49,682 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1166203689, now seen corresponding path program 204 times [2022-04-08 10:08:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:49,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937419113] [2022-04-08 10:08:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {68524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {68497#true} is VALID [2022-04-08 10:08:50,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-08 10:08:50,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-08 10:08:50,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {68497#true} call ULTIMATE.init(); {68524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:50,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {68524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {68497#true} is VALID [2022-04-08 10:08:50,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-08 10:08:50,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-08 10:08:50,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {68497#true} call #t~ret9 := main(); {68497#true} is VALID [2022-04-08 10:08:50,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {68497#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68502#(= main_~y~0 0)} is VALID [2022-04-08 10:08:50,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {68502#(= 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; {68503#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:50,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {68503#(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; {68504#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:50,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {68504#(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; {68505#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:50,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {68505#(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; {68506#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:50,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {68506#(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; {68507#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:50,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {68507#(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; {68508#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:50,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {68508#(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; {68509#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:50,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {68509#(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; {68510#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:50,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {68510#(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; {68511#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:50,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {68511#(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; {68512#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:50,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {68512#(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; {68513#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:50,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {68513#(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; {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:50,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:50,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {68515#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:50,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {68515#(and (<= main_~z~0 12) (<= 12 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; {68516#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:50,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {68516#(and (<= main_~z~0 11) (<= 11 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; {68517#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:50,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {68517#(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; {68518#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:50,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {68518#(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; {68519#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:50,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {68519#(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; {68520#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:50,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {68520#(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; {68521#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:50,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {68521#(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; {68522#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:50,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {68522#(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; {68523#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:50,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {68523#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {68498#false} is VALID [2022-04-08 10:08:50,080 INFO L272 TraceCheckUtils]: 29: Hoare triple {68498#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68498#false} is VALID [2022-04-08 10:08:50,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {68498#false} ~cond := #in~cond; {68498#false} is VALID [2022-04-08 10:08:50,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {68498#false} assume 0 == ~cond; {68498#false} is VALID [2022-04-08 10:08:50,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {68498#false} assume !false; {68498#false} is VALID [2022-04-08 10:08:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:50,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:50,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937419113] [2022-04-08 10:08:50,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937419113] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:50,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558798944] [2022-04-08 10:08:50,080 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:50,081 INFO L229 MonitoredProcess]: Starting monitored process 122 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,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-04-08 10:08:50,151 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:08:50,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:50,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:08:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:50,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {68497#true} call ULTIMATE.init(); {68497#true} is VALID [2022-04-08 10:08:50,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {68497#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); {68497#true} is VALID [2022-04-08 10:08:50,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-08 10:08:50,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-08 10:08:50,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {68497#true} call #t~ret9 := main(); {68497#true} is VALID [2022-04-08 10:08:50,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {68497#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68502#(= main_~y~0 0)} is VALID [2022-04-08 10:08:50,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {68502#(= 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; {68503#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:50,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {68503#(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; {68504#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:50,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {68504#(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; {68505#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:50,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {68505#(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; {68506#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:50,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {68506#(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; {68507#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:50,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {68507#(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; {68508#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:50,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {68508#(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; {68509#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:50,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {68509#(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; {68510#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:50,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {68510#(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; {68511#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:50,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {68511#(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; {68512#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:50,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {68512#(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; {68513#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:50,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {68513#(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; {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:50,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:50,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {68514#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {68515#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:50,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {68515#(and (<= main_~z~0 12) (<= 12 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; {68516#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:50,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {68516#(and (<= main_~z~0 11) (<= 11 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; {68517#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:50,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {68517#(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; {68518#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:50,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {68518#(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; {68519#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:50,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {68519#(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; {68520#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:50,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {68520#(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; {68521#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:50,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {68521#(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; {68522#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:50,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {68522#(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; {68609#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:50,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {68609#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {68498#false} is VALID [2022-04-08 10:08:50,451 INFO L272 TraceCheckUtils]: 29: Hoare triple {68498#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68498#false} is VALID [2022-04-08 10:08:50,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {68498#false} ~cond := #in~cond; {68498#false} is VALID [2022-04-08 10:08:50,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {68498#false} assume 0 == ~cond; {68498#false} is VALID [2022-04-08 10:08:50,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {68498#false} assume !false; {68498#false} is VALID [2022-04-08 10:08:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:50,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:51,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {68498#false} assume !false; {68498#false} is VALID [2022-04-08 10:08:51,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {68498#false} assume 0 == ~cond; {68498#false} is VALID [2022-04-08 10:08:51,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {68498#false} ~cond := #in~cond; {68498#false} is VALID [2022-04-08 10:08:51,202 INFO L272 TraceCheckUtils]: 29: Hoare triple {68498#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68498#false} is VALID [2022-04-08 10:08:51,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {68637#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {68498#false} is VALID [2022-04-08 10:08:51,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {68641#(< 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; {68637#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:51,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {68645#(< 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; {68641#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:51,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {68649#(< 0 (mod (+ main_~z~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; {68645#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:51,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {68653#(< 0 (mod (+ 4294967292 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; {68649#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:51,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {68657#(< 0 (mod (+ 4294967291 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; {68653#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:51,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {68661#(< 0 (mod (+ 4294967290 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; {68657#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:51,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {68665#(< 0 (mod (+ main_~z~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; {68661#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:51,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {68669#(< 0 (mod (+ 4294967288 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; {68665#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:51,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {68673#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {68669#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:51,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {68673#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {68673#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:51,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {68680#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {68673#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:51,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {68684#(< 0 (mod (+ 4294967290 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; {68680#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:51,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {68688#(< 0 (mod (+ 4294967291 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; {68684#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:51,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {68692#(< 0 (mod (+ 4294967292 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; {68688#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:51,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {68696#(< 0 (mod (+ main_~y~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; {68692#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:51,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {68700#(< 0 (mod (+ main_~y~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; {68696#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:51,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {68704#(< 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; {68700#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:51,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {68708#(< 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; {68704#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:51,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {68712#(< 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; {68708#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:51,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {68716#(< 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; {68712#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:51,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {68720#(< 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; {68716#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:51,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {68724#(< 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; {68720#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:51,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {68497#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68724#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:51,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {68497#true} call #t~ret9 := main(); {68497#true} is VALID [2022-04-08 10:08:51,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68497#true} {68497#true} #50#return; {68497#true} is VALID [2022-04-08 10:08:51,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {68497#true} assume true; {68497#true} is VALID [2022-04-08 10:08:51,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {68497#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); {68497#true} is VALID [2022-04-08 10:08:51,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {68497#true} call ULTIMATE.init(); {68497#true} is VALID [2022-04-08 10:08:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:51,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558798944] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:51,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:51,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:08:51,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:51,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718168533] [2022-04-08 10:08:51,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718168533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:51,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:51,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:08:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710701947] [2022-04-08 10:08:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:51,218 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:51,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:51,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:51,238 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:08:51,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:08:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:08:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:08:51,239 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:54,933 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-04-08 10:08:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 10:08:54,933 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2022-04-08 10:08:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2022-04-08 10:08:54,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 72 transitions. [2022-04-08 10:08:54,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:54,977 INFO L225 Difference]: With dead ends: 92 [2022-04-08 10:08:54,978 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 10:08:54,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1241, Invalid=5899, Unknown=0, NotChecked=0, Total=7140 [2022-04-08 10:08:54,978 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:54,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:08:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 10:08:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2022-04-08 10:08:55,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:55,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,538 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,538 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:55,539 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-08 10:08:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-08 10:08:55,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:55,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:55,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 87 states. [2022-04-08 10:08:55,539 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 87 states. [2022-04-08 10:08:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:55,540 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-04-08 10:08:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-04-08 10:08:55,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:55,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:55,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:55,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:08:55,541 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:08:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:55,541 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:08:55,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:55,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:08:57,125 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:08:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:08:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:08:57,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:57,126 INFO L499 BasicCegarLoop]: trace histogram [13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:57,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:57,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2022-04-08 10:08:57,342 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:57,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1067055850, now seen corresponding path program 205 times [2022-04-08 10:08:57,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:57,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [455920896] [2022-04-08 10:08:57,344 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:57,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1067055850, now seen corresponding path program 206 times [2022-04-08 10:08:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:57,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623960353] [2022-04-08 10:08:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:57,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {69314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {69287#true} is VALID [2022-04-08 10:08:57,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-08 10:08:57,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-08 10:08:57,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {69287#true} call ULTIMATE.init(); {69314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:57,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {69314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {69287#true} is VALID [2022-04-08 10:08:57,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-08 10:08:57,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-08 10:08:57,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {69287#true} call #t~ret9 := main(); {69287#true} is VALID [2022-04-08 10:08:57,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {69287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69292#(= main_~y~0 0)} is VALID [2022-04-08 10:08:57,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {69292#(= 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; {69293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:57,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {69293#(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; {69294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:57,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {69294#(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; {69295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:57,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {69295#(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; {69296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:57,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {69296#(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; {69297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:57,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {69297#(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; {69298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:57,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {69298#(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; {69299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:57,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {69299#(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; {69300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:57,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {69300#(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; {69301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:57,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {69301#(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; {69302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:57,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {69302#(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; {69303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:57,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {69303#(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; {69304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:57,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {69304#(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; {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:57,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:57,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {69306#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:57,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {69306#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69307#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:57,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {69307#(and (<= main_~z~0 12) (<= 12 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; {69308#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:57,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {69308#(and (<= main_~z~0 11) (<= 11 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; {69309#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:57,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {69309#(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; {69310#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:57,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {69310#(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; {69311#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:57,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {69311#(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; {69312#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:57,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {69312#(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; {69313#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:57,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {69313#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69288#false} is VALID [2022-04-08 10:08:57,691 INFO L272 TraceCheckUtils]: 29: Hoare triple {69288#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69288#false} is VALID [2022-04-08 10:08:57,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {69288#false} ~cond := #in~cond; {69288#false} is VALID [2022-04-08 10:08:57,691 INFO L290 TraceCheckUtils]: 31: Hoare triple {69288#false} assume 0 == ~cond; {69288#false} is VALID [2022-04-08 10:08:57,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {69288#false} assume !false; {69288#false} is VALID [2022-04-08 10:08:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:57,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:57,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623960353] [2022-04-08 10:08:57,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623960353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:57,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683034304] [2022-04-08 10:08:57,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:57,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:57,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:57,692 INFO L229 MonitoredProcess]: Starting monitored process 123 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:57,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-04-08 10:08:57,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:57,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:57,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:08:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:58,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {69287#true} call ULTIMATE.init(); {69287#true} is VALID [2022-04-08 10:08:58,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {69287#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); {69287#true} is VALID [2022-04-08 10:08:58,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-08 10:08:58,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-08 10:08:58,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {69287#true} call #t~ret9 := main(); {69287#true} is VALID [2022-04-08 10:08:58,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {69287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69292#(= main_~y~0 0)} is VALID [2022-04-08 10:08:58,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {69292#(= 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; {69293#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:58,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {69293#(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; {69294#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:58,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {69294#(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; {69295#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {69295#(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; {69296#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:58,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {69296#(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; {69297#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:58,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {69297#(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; {69298#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:58,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {69298#(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; {69299#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:58,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {69299#(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; {69300#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:58,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {69300#(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; {69301#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:58,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {69301#(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; {69302#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:58,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {69302#(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; {69303#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:58,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {69303#(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; {69304#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:58,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {69304#(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; {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:58,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:58,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {69305#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {69306#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:08:58,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {69306#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69307#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:08:58,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {69307#(and (<= main_~z~0 12) (<= 12 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; {69308#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:08:58,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {69308#(and (<= main_~z~0 11) (<= 11 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; {69309#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:58,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {69309#(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; {69310#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:58,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {69310#(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; {69311#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:58,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {69311#(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; {69312#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:58,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {69312#(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; {69399#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:58,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {69399#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {69288#false} is VALID [2022-04-08 10:08:58,078 INFO L272 TraceCheckUtils]: 29: Hoare triple {69288#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69288#false} is VALID [2022-04-08 10:08:58,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {69288#false} ~cond := #in~cond; {69288#false} is VALID [2022-04-08 10:08:58,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {69288#false} assume 0 == ~cond; {69288#false} is VALID [2022-04-08 10:08:58,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {69288#false} assume !false; {69288#false} is VALID [2022-04-08 10:08:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:58,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:58,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {69288#false} assume !false; {69288#false} is VALID [2022-04-08 10:08:58,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {69288#false} assume 0 == ~cond; {69288#false} is VALID [2022-04-08 10:08:58,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {69288#false} ~cond := #in~cond; {69288#false} is VALID [2022-04-08 10:08:58,904 INFO L272 TraceCheckUtils]: 29: Hoare triple {69288#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69288#false} is VALID [2022-04-08 10:08:58,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {69427#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {69288#false} is VALID [2022-04-08 10:08:58,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {69431#(< 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; {69427#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:58,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {69435#(< 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; {69431#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:58,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {69439#(< 0 (mod (+ main_~z~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; {69435#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:58,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {69443#(< 0 (mod (+ 4294967292 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; {69439#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:58,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {69447#(< 0 (mod (+ 4294967291 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; {69443#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:58,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {69451#(< 0 (mod (+ 4294967290 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; {69447#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:58,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {69455#(< 0 (mod (+ main_~z~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; {69451#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:08:58,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {69459#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {69455#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:58,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {69459#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69459#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:58,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {69466#(< 0 (mod (+ 4294967290 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; {69459#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:58,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {69470#(< 0 (mod (+ 4294967291 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; {69466#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:58,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {69474#(< 0 (mod (+ 4294967292 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; {69470#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:58,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {69478#(< 0 (mod (+ main_~y~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; {69474#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:58,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {69482#(< 0 (mod (+ main_~y~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; {69478#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:58,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {69486#(< 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; {69482#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:58,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {69490#(< 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; {69486#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:58,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {69494#(< 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; {69490#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:58,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {69498#(< 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; {69494#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:58,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {69502#(< 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; {69498#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:58,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {69506#(< 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; {69502#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:58,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {69510#(< 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; {69506#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:58,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {69514#(< 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; {69510#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:58,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {69287#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69514#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:58,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {69287#true} call #t~ret9 := main(); {69287#true} is VALID [2022-04-08 10:08:58,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69287#true} {69287#true} #50#return; {69287#true} is VALID [2022-04-08 10:08:58,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {69287#true} assume true; {69287#true} is VALID [2022-04-08 10:08:58,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {69287#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); {69287#true} is VALID [2022-04-08 10:08:58,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {69287#true} call ULTIMATE.init(); {69287#true} is VALID [2022-04-08 10:08:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:58,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683034304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:58,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:58,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:08:58,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:58,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [455920896] [2022-04-08 10:08:58,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [455920896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:58,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:58,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:08:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516833293] [2022-04-08 10:08:58,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:58,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:58,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:08:58,945 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:08:58,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:08:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:58,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:08:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1899, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:08:58,945 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:04,315 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-04-08 10:09:04,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 10:09:04,315 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 80 transitions. [2022-04-08 10:09:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 80 transitions. [2022-04-08 10:09:04,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 80 transitions. [2022-04-08 10:09:04,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:04,382 INFO L225 Difference]: With dead ends: 101 [2022-04-08 10:09:04,382 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 10:09:04,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1361, Invalid=6295, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:09:04,383 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:04,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:09:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 10:09:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2022-04-08 10:09:05,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:05,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:05,106 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:05,106 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:05,107 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-08 10:09:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-08 10:09:05,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:05,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:05,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 96 states. [2022-04-08 10:09:05,108 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 96 states. [2022-04-08 10:09:05,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:05,108 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2022-04-08 10:09:05,108 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-04-08 10:09:05,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:05,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:05,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:05,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:05,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:09:05,109 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:09:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:05,109 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:09:05,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:05,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:09:06,889 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:09:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:09:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:06,890 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:06,890 INFO L499 BasicCegarLoop]: trace histogram [14, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:06,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:07,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:07,091 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1479499529, now seen corresponding path program 207 times [2022-04-08 10:09:07,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:07,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [978757905] [2022-04-08 10:09:07,094 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:07,094 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1479499529, now seen corresponding path program 208 times [2022-04-08 10:09:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:07,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667538176] [2022-04-08 10:09:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:07,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {70146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {70119#true} is VALID [2022-04-08 10:09:07,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-08 10:09:07,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-08 10:09:07,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {70119#true} call ULTIMATE.init(); {70146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:07,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {70146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {70119#true} is VALID [2022-04-08 10:09:07,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-08 10:09:07,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-08 10:09:07,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {70119#true} call #t~ret9 := main(); {70119#true} is VALID [2022-04-08 10:09:07,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {70119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70124#(= main_~y~0 0)} is VALID [2022-04-08 10:09:07,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {70124#(= 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; {70125#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:07,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {70125#(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; {70126#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:07,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {70126#(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; {70127#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:07,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {70127#(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; {70128#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:07,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {70128#(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; {70129#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:07,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {70129#(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; {70130#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:07,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {70130#(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; {70131#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:07,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {70131#(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; {70132#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:07,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {70132#(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; {70133#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:07,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {70133#(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; {70134#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:07,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {70134#(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; {70135#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:07,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {70135#(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; {70136#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:07,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {70136#(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; {70137#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:07,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {70137#(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; {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:07,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:07,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {70139#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:07,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {70139#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70140#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:07,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {70140#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70141#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:07,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {70141#(and (<= main_~z~0 12) (<= 12 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; {70142#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:07,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {70142#(and (<= main_~z~0 11) (<= 11 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; {70143#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:07,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {70143#(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; {70144#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:07,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {70144#(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; {70145#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:07,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {70145#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70120#false} is VALID [2022-04-08 10:09:07,517 INFO L272 TraceCheckUtils]: 29: Hoare triple {70120#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70120#false} is VALID [2022-04-08 10:09:07,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {70120#false} ~cond := #in~cond; {70120#false} is VALID [2022-04-08 10:09:07,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {70120#false} assume 0 == ~cond; {70120#false} is VALID [2022-04-08 10:09:07,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {70120#false} assume !false; {70120#false} is VALID [2022-04-08 10:09:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:07,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:07,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667538176] [2022-04-08 10:09:07,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667538176] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:07,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173308543] [2022-04-08 10:09:07,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:07,519 INFO L229 MonitoredProcess]: Starting monitored process 124 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:07,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-04-08 10:09:07,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:07,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:07,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:09:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:07,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:07,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {70119#true} call ULTIMATE.init(); {70119#true} is VALID [2022-04-08 10:09:07,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {70119#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); {70119#true} is VALID [2022-04-08 10:09:07,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-08 10:09:07,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-08 10:09:07,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {70119#true} call #t~ret9 := main(); {70119#true} is VALID [2022-04-08 10:09:07,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {70119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70124#(= main_~y~0 0)} is VALID [2022-04-08 10:09:07,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {70124#(= 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; {70125#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:07,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {70125#(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; {70126#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:07,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {70126#(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; {70127#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:07,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {70127#(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; {70128#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:07,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {70128#(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; {70129#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:07,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {70129#(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; {70130#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:07,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {70130#(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; {70131#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:07,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {70131#(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; {70132#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:07,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {70132#(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; {70133#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:07,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {70133#(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; {70134#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:07,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {70134#(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; {70135#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:07,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {70135#(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; {70136#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:07,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {70136#(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; {70137#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:07,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {70137#(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; {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:07,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:07,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {70138#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {70139#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:07,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {70139#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70140#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:07,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {70140#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70141#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:07,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {70141#(and (<= main_~z~0 12) (<= 12 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; {70142#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:07,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {70142#(and (<= main_~z~0 11) (<= 11 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; {70143#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:07,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {70143#(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; {70144#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:09:07,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {70144#(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; {70231#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:07,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {70231#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {70120#false} is VALID [2022-04-08 10:09:07,850 INFO L272 TraceCheckUtils]: 29: Hoare triple {70120#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70120#false} is VALID [2022-04-08 10:09:07,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {70120#false} ~cond := #in~cond; {70120#false} is VALID [2022-04-08 10:09:07,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {70120#false} assume 0 == ~cond; {70120#false} is VALID [2022-04-08 10:09:07,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {70120#false} assume !false; {70120#false} is VALID [2022-04-08 10:09:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:07,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:08,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {70120#false} assume !false; {70120#false} is VALID [2022-04-08 10:09:08,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {70120#false} assume 0 == ~cond; {70120#false} is VALID [2022-04-08 10:09:08,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {70120#false} ~cond := #in~cond; {70120#false} is VALID [2022-04-08 10:09:08,669 INFO L272 TraceCheckUtils]: 29: Hoare triple {70120#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70120#false} is VALID [2022-04-08 10:09:08,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {70259#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70120#false} is VALID [2022-04-08 10:09:08,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {70263#(< 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; {70259#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:08,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {70267#(< 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; {70263#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:08,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {70271#(< 0 (mod (+ main_~z~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; {70267#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:08,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {70275#(< 0 (mod (+ 4294967292 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; {70271#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:08,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {70279#(< 0 (mod (+ 4294967291 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; {70275#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:08,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {70283#(< 0 (mod (+ 4294967290 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; {70279#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:08,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {70287#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {70283#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:08,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {70287#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {70287#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:08,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {70294#(< 0 (mod (+ 4294967291 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; {70287#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:08,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {70298#(< 0 (mod (+ 4294967292 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; {70294#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:08,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {70302#(< 0 (mod (+ main_~y~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; {70298#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:08,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {70306#(< 0 (mod (+ main_~y~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; {70302#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:08,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {70310#(< 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; {70306#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:08,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {70314#(< 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; {70310#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:08,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {70318#(< 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; {70314#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:08,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {70322#(< 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; {70318#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:08,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {70326#(< 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; {70322#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:08,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {70330#(< 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; {70326#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:08,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {70334#(< 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; {70330#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:08,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {70338#(< 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; {70334#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:08,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {70342#(< 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; {70338#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:08,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {70346#(< 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; {70342#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:08,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {70119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70346#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:08,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {70119#true} call #t~ret9 := main(); {70119#true} is VALID [2022-04-08 10:09:08,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70119#true} {70119#true} #50#return; {70119#true} is VALID [2022-04-08 10:09:08,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {70119#true} assume true; {70119#true} is VALID [2022-04-08 10:09:08,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {70119#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); {70119#true} is VALID [2022-04-08 10:09:08,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {70119#true} call ULTIMATE.init(); {70119#true} is VALID [2022-04-08 10:09:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:08,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173308543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:08,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:08,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:09:08,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:08,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [978757905] [2022-04-08 10:09:08,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [978757905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:08,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:08,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734801339] [2022-04-08 10:09:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:08,691 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:08,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:08,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:08,719 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:09:08,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1882, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:09:08,720 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:13,203 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2022-04-08 10:09:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 10:09:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions. [2022-04-08 10:09:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions. [2022-04-08 10:09:13,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 85 transitions. [2022-04-08 10:09:13,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:13,256 INFO L225 Difference]: With dead ends: 109 [2022-04-08 10:09:13,256 INFO L226 Difference]: Without dead ends: 104 [2022-04-08 10:09:13,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1392, Invalid=6264, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:09:13,257 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:13,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 133 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:09:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-08 10:09:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 55. [2022-04-08 10:09:13,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:13,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:13,828 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:13,828 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:13,829 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-08 10:09:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-04-08 10:09:13,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:13,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:13,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 104 states. [2022-04-08 10:09:13,829 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 104 states. [2022-04-08 10:09:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:13,830 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-08 10:09:13,830 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-04-08 10:09:13,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:13,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:13,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:13,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:09:13,831 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:09:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:13,831 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:09:13,831 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:13,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:09:15,470 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:09:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:09:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:15,470 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:15,470 INFO L499 BasicCegarLoop]: trace histogram [15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:15,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:15,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-04-08 10:09:15,675 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 446858486, now seen corresponding path program 209 times [2022-04-08 10:09:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:15,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [490337791] [2022-04-08 10:09:15,678 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:15,678 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:15,679 INFO L85 PathProgramCache]: Analyzing trace with hash 446858486, now seen corresponding path program 210 times [2022-04-08 10:09:15,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:15,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801799956] [2022-04-08 10:09:15,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:15,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:15,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {71010#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {70983#true} is VALID [2022-04-08 10:09:15,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-08 10:09:15,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-08 10:09:15,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {70983#true} call ULTIMATE.init(); {71010#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:15,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {71010#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {70983#true} is VALID [2022-04-08 10:09:15,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-08 10:09:15,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-08 10:09:15,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {70983#true} call #t~ret9 := main(); {70983#true} is VALID [2022-04-08 10:09:15,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {70983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70988#(= main_~y~0 0)} is VALID [2022-04-08 10:09:15,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {70988#(= 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; {70989#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:15,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {70989#(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; {70990#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:15,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {70990#(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; {70991#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:15,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {70991#(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; {70992#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:15,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {70992#(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; {70993#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:15,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {70993#(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; {70994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:15,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {70994#(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; {70995#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:15,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {70995#(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; {70996#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:15,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {70996#(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; {70997#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:15,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {70997#(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; {70998#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:15,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {70998#(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; {70999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:15,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {70999#(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; {71000#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:15,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {71000#(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; {71001#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:15,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {71001#(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; {71002#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:15,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {71002#(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; {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:15,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:15,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {71004#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:15,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {71004#(and (<= main_~z~0 15) (<= 15 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; {71005#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:15,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {71005#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71006#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:15,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {71006#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71007#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:15,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {71007#(and (<= main_~z~0 12) (<= 12 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; {71008#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:15,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {71008#(and (<= main_~z~0 11) (<= 11 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; {71009#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:15,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {71009#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70984#false} is VALID [2022-04-08 10:09:15,967 INFO L272 TraceCheckUtils]: 29: Hoare triple {70984#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70984#false} is VALID [2022-04-08 10:09:15,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {70984#false} ~cond := #in~cond; {70984#false} is VALID [2022-04-08 10:09:15,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {70984#false} assume 0 == ~cond; {70984#false} is VALID [2022-04-08 10:09:15,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {70984#false} assume !false; {70984#false} is VALID [2022-04-08 10:09:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:15,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801799956] [2022-04-08 10:09:15,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801799956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:15,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498192981] [2022-04-08 10:09:15,968 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:15,969 INFO L229 MonitoredProcess]: Starting monitored process 125 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:15,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-04-08 10:09:16,226 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:09:16,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:16,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:09:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:16,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:16,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {70983#true} call ULTIMATE.init(); {70983#true} is VALID [2022-04-08 10:09:16,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {70983#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); {70983#true} is VALID [2022-04-08 10:09:16,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-08 10:09:16,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-08 10:09:16,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {70983#true} call #t~ret9 := main(); {70983#true} is VALID [2022-04-08 10:09:16,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {70983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70988#(= main_~y~0 0)} is VALID [2022-04-08 10:09:16,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {70988#(= 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; {70989#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:16,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {70989#(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; {70990#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:16,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {70990#(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; {70991#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:16,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {70991#(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; {70992#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:16,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {70992#(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; {70993#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:16,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {70993#(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; {70994#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:16,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {70994#(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; {70995#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:16,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {70995#(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; {70996#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:16,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {70996#(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; {70997#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:16,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {70997#(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; {70998#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:16,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {70998#(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; {70999#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:16,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {70999#(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; {71000#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:16,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {71000#(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; {71001#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:16,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {71001#(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; {71002#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:16,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {71002#(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; {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:16,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:16,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {71003#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {71004#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:16,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {71004#(and (<= main_~z~0 15) (<= 15 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; {71005#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:16,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {71005#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71006#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:16,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {71006#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71007#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:16,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {71007#(and (<= main_~z~0 12) (<= 12 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; {71008#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:09:16,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {71008#(and (<= main_~z~0 11) (<= 11 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; {71095#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:09:16,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {71095#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {70984#false} is VALID [2022-04-08 10:09:16,561 INFO L272 TraceCheckUtils]: 29: Hoare triple {70984#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70984#false} is VALID [2022-04-08 10:09:16,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {70984#false} ~cond := #in~cond; {70984#false} is VALID [2022-04-08 10:09:16,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {70984#false} assume 0 == ~cond; {70984#false} is VALID [2022-04-08 10:09:16,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {70984#false} assume !false; {70984#false} is VALID [2022-04-08 10:09:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:16,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:17,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {70984#false} assume !false; {70984#false} is VALID [2022-04-08 10:09:17,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {70984#false} assume 0 == ~cond; {70984#false} is VALID [2022-04-08 10:09:17,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {70984#false} ~cond := #in~cond; {70984#false} is VALID [2022-04-08 10:09:17,225 INFO L272 TraceCheckUtils]: 29: Hoare triple {70984#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70984#false} is VALID [2022-04-08 10:09:17,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {71123#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70984#false} is VALID [2022-04-08 10:09:17,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {71127#(< 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; {71123#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:17,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {71131#(< 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; {71127#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:17,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {71135#(< 0 (mod (+ main_~z~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; {71131#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:17,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {71139#(< 0 (mod (+ 4294967292 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; {71135#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:17,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {71143#(< 0 (mod (+ 4294967291 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; {71139#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:17,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {71147#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {71143#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:17,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {71147#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {71147#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {71154#(< 0 (mod (+ 4294967292 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; {71147#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {71158#(< 0 (mod (+ main_~y~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; {71154#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {71162#(< 0 (mod (+ main_~y~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; {71158#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:17,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {71166#(< 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; {71162#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:17,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {71170#(< 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; {71166#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:17,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {71174#(< 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; {71170#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:17,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {71178#(< 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; {71174#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:17,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {71182#(< 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; {71178#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:17,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {71186#(< 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; {71182#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:17,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {71190#(< 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; {71186#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:17,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {71194#(< 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; {71190#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {71198#(< 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; {71194#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:17,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {71202#(< 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; {71198#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {71206#(< 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; {71202#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:17,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {71210#(< 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; {71206#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:17,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {70983#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71210#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:17,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {70983#true} call #t~ret9 := main(); {70983#true} is VALID [2022-04-08 10:09:17,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70983#true} {70983#true} #50#return; {70983#true} is VALID [2022-04-08 10:09:17,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {70983#true} assume true; {70983#true} is VALID [2022-04-08 10:09:17,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {70983#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); {70983#true} is VALID [2022-04-08 10:09:17,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {70983#true} call ULTIMATE.init(); {70983#true} is VALID [2022-04-08 10:09:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:17,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498192981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:17,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:17,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:09:17,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:17,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [490337791] [2022-04-08 10:09:17,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [490337791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:17,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285859860] [2022-04-08 10:09:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:17,241 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:17,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:17,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:17,257 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:09:17,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:17,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:09:17,258 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:22,078 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-08 10:09:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 10:09:22,078 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-08 10:09:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 87 transitions. [2022-04-08 10:09:22,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 87 transitions. [2022-04-08 10:09:22,137 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:09:22,138 INFO L225 Difference]: With dead ends: 116 [2022-04-08 10:09:22,138 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 10:09:22,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1323, Invalid=5817, Unknown=0, NotChecked=0, Total=7140 [2022-04-08 10:09:22,138 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:22,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 141 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:09:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 10:09:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 55. [2022-04-08 10:09:22,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:22,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:22,731 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:22,731 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:22,732 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2022-04-08 10:09:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2022-04-08 10:09:22,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:22,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:22,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 111 states. [2022-04-08 10:09:22,732 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 111 states. [2022-04-08 10:09:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:22,733 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2022-04-08 10:09:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2022-04-08 10:09:22,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:22,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:22,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:22,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:09:22,734 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:09:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:22,734 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:09:22,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:22,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:09:24,690 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:09:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:09:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:24,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:24,690 INFO L499 BasicCegarLoop]: trace histogram [16, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:24,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2022-04-08 10:09:24,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-04-08 10:09:24,896 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash 370451735, now seen corresponding path program 211 times [2022-04-08 10:09:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:24,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790940464] [2022-04-08 10:09:24,898 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:24,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash 370451735, now seen corresponding path program 212 times [2022-04-08 10:09:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:24,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019062126] [2022-04-08 10:09:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:24,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:25,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {71896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {71869#true} is VALID [2022-04-08 10:09:25,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-08 10:09:25,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-08 10:09:25,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {71869#true} call ULTIMATE.init(); {71896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:25,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {71896#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {71869#true} is VALID [2022-04-08 10:09:25,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-08 10:09:25,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-08 10:09:25,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {71869#true} call #t~ret9 := main(); {71869#true} is VALID [2022-04-08 10:09:25,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {71869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71874#(= main_~y~0 0)} is VALID [2022-04-08 10:09:25,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {71874#(= 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; {71875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:25,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {71875#(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; {71876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:25,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {71876#(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; {71877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:25,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {71877#(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; {71878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:25,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {71878#(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; {71879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:25,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {71879#(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; {71880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:25,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {71880#(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; {71881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:25,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {71881#(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; {71882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:25,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {71882#(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; {71883#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:25,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {71883#(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; {71884#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:25,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {71884#(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; {71885#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:25,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {71885#(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; {71886#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:25,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {71886#(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; {71887#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:25,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {71887#(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; {71888#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:25,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {71888#(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; {71889#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:25,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {71889#(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; {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:25,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:25,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {71891#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:25,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {71891#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71892#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:25,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {71892#(and (<= main_~z~0 15) (<= 15 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; {71893#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:25,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {71893#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71894#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:25,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {71894#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71895#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:25,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {71895#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71870#false} is VALID [2022-04-08 10:09:25,298 INFO L272 TraceCheckUtils]: 29: Hoare triple {71870#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71870#false} is VALID [2022-04-08 10:09:25,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {71870#false} ~cond := #in~cond; {71870#false} is VALID [2022-04-08 10:09:25,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {71870#false} assume 0 == ~cond; {71870#false} is VALID [2022-04-08 10:09:25,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {71870#false} assume !false; {71870#false} is VALID [2022-04-08 10:09:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019062126] [2022-04-08 10:09:25,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019062126] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:25,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483034699] [2022-04-08 10:09:25,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:25,299 INFO L229 MonitoredProcess]: Starting monitored process 126 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:25,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-04-08 10:09:25,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:25,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:25,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:09:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:25,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:25,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {71869#true} call ULTIMATE.init(); {71869#true} is VALID [2022-04-08 10:09:25,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {71869#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); {71869#true} is VALID [2022-04-08 10:09:25,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-08 10:09:25,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-08 10:09:25,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {71869#true} call #t~ret9 := main(); {71869#true} is VALID [2022-04-08 10:09:25,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {71869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71874#(= main_~y~0 0)} is VALID [2022-04-08 10:09:25,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {71874#(= 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; {71875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:25,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {71875#(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; {71876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:25,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {71876#(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; {71877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:25,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {71877#(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; {71878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:25,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {71878#(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; {71879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:25,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {71879#(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; {71880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:25,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {71880#(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; {71881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:25,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {71881#(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; {71882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:25,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {71882#(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; {71883#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:25,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {71883#(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; {71884#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:25,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {71884#(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; {71885#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:25,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {71885#(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; {71886#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:25,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {71886#(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; {71887#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:25,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {71887#(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; {71888#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:25,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {71888#(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; {71889#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:25,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {71889#(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; {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:25,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:25,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {71890#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {71891#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:25,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {71891#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71892#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:25,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {71892#(and (<= main_~z~0 15) (<= 15 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; {71893#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:25,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {71893#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71894#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:09:25,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {71894#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71981#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:09:25,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {71981#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71870#false} is VALID [2022-04-08 10:09:25,602 INFO L272 TraceCheckUtils]: 29: Hoare triple {71870#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71870#false} is VALID [2022-04-08 10:09:25,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {71870#false} ~cond := #in~cond; {71870#false} is VALID [2022-04-08 10:09:25,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {71870#false} assume 0 == ~cond; {71870#false} is VALID [2022-04-08 10:09:25,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {71870#false} assume !false; {71870#false} is VALID [2022-04-08 10:09:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:25,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:26,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {71870#false} assume !false; {71870#false} is VALID [2022-04-08 10:09:26,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {71870#false} assume 0 == ~cond; {71870#false} is VALID [2022-04-08 10:09:26,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {71870#false} ~cond := #in~cond; {71870#false} is VALID [2022-04-08 10:09:26,351 INFO L272 TraceCheckUtils]: 29: Hoare triple {71870#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71870#false} is VALID [2022-04-08 10:09:26,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {72009#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {71870#false} is VALID [2022-04-08 10:09:26,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {72013#(< 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; {72009#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:26,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {72017#(< 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; {72013#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:26,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {72021#(< 0 (mod (+ main_~z~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; {72017#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:26,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {72025#(< 0 (mod (+ 4294967292 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; {72021#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:26,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {72029#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {72025#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:26,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {72029#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72029#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:26,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {72036#(< 0 (mod (+ main_~y~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; {72029#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:26,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {72040#(< 0 (mod (+ main_~y~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; {72036#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:26,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {72044#(< 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; {72040#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:26,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {72048#(< 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; {72044#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:26,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {72052#(< 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; {72048#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:26,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {72056#(< 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; {72052#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:26,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {72060#(< 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; {72056#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:26,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {72064#(< 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; {72060#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:26,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {72068#(< 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; {72064#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:26,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {72072#(< 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; {72068#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:26,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {72076#(< 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; {72072#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:26,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {72080#(< 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; {72076#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:26,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {72084#(< 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; {72080#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:26,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {72088#(< 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; {72084#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:26,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {72092#(< 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; {72088#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:26,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {72096#(< 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; {72092#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:26,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {71869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72096#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:26,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {71869#true} call #t~ret9 := main(); {71869#true} is VALID [2022-04-08 10:09:26,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71869#true} {71869#true} #50#return; {71869#true} is VALID [2022-04-08 10:09:26,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {71869#true} assume true; {71869#true} is VALID [2022-04-08 10:09:26,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {71869#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); {71869#true} is VALID [2022-04-08 10:09:26,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {71869#true} call ULTIMATE.init(); {71869#true} is VALID [2022-04-08 10:09:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483034699] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:26,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:26,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:09:26,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790940464] [2022-04-08 10:09:26,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790940464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:26,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:26,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340302783] [2022-04-08 10:09:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:26,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:26,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:26,383 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:09:26,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:26,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:26,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:26,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=1844, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:09:26,384 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:31,023 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2022-04-08 10:09:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:09:31,023 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-08 10:09:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-08 10:09:31,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 87 transitions. [2022-04-08 10:09:31,072 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:09:31,073 INFO L225 Difference]: With dead ends: 122 [2022-04-08 10:09:31,073 INFO L226 Difference]: Without dead ends: 117 [2022-04-08 10:09:31,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1204, Invalid=5116, Unknown=0, NotChecked=0, Total=6320 [2022-04-08 10:09:31,074 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:31,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 126 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:09:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-08 10:09:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 55. [2022-04-08 10:09:31,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:31,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,616 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,616 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:31,617 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-04-08 10:09:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2022-04-08 10:09:31,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:31,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:31,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 117 states. [2022-04-08 10:09:31,618 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 117 states. [2022-04-08 10:09:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:31,619 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-04-08 10:09:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2022-04-08 10:09:31,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:31,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:31,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:31,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:09:31,619 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:09:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:31,620 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:09:31,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:31,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:09:33,174 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:09:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:09:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:33,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:33,174 INFO L499 BasicCegarLoop]: trace histogram [17, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:33,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:33,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2022-04-08 10:09:33,387 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818326, now seen corresponding path program 213 times [2022-04-08 10:09:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:33,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1191735658] [2022-04-08 10:09:33,390 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:33,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:33,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818326, now seen corresponding path program 214 times [2022-04-08 10:09:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:33,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853497437] [2022-04-08 10:09:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {72796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {72769#true} is VALID [2022-04-08 10:09:33,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-08 10:09:33,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-08 10:09:33,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {72769#true} call ULTIMATE.init(); {72796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:33,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {72796#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {72769#true} is VALID [2022-04-08 10:09:33,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-08 10:09:33,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-08 10:09:33,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {72769#true} call #t~ret9 := main(); {72769#true} is VALID [2022-04-08 10:09:33,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {72769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72774#(= main_~y~0 0)} is VALID [2022-04-08 10:09:33,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {72774#(= 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; {72775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:33,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {72775#(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; {72776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:33,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {72776#(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; {72777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:33,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {72777#(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; {72778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:33,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {72778#(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; {72779#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:33,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {72779#(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; {72780#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:33,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {72780#(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; {72781#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:33,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {72781#(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; {72782#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:33,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {72782#(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; {72783#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:33,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {72783#(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; {72784#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:33,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {72784#(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; {72785#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:33,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {72785#(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; {72786#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:33,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {72786#(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; {72787#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:33,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {72787#(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; {72788#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:33,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {72788#(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; {72789#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:33,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {72789#(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; {72790#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:33,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {72790#(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; {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:33,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:33,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {72792#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:09:33,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {72792#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72793#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:33,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {72793#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72794#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:33,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {72794#(and (<= main_~z~0 15) (<= 15 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; {72795#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:33,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {72795#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {72770#false} is VALID [2022-04-08 10:09:33,810 INFO L272 TraceCheckUtils]: 29: Hoare triple {72770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {72770#false} is VALID [2022-04-08 10:09:33,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {72770#false} ~cond := #in~cond; {72770#false} is VALID [2022-04-08 10:09:33,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {72770#false} assume 0 == ~cond; {72770#false} is VALID [2022-04-08 10:09:33,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {72770#false} assume !false; {72770#false} is VALID [2022-04-08 10:09:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:33,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853497437] [2022-04-08 10:09:33,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853497437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549171938] [2022-04-08 10:09:33,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:33,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:33,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:33,812 INFO L229 MonitoredProcess]: Starting monitored process 127 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:33,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-04-08 10:09:33,851 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:33,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:33,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:09:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:34,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {72769#true} call ULTIMATE.init(); {72769#true} is VALID [2022-04-08 10:09:34,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {72769#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); {72769#true} is VALID [2022-04-08 10:09:34,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-08 10:09:34,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-08 10:09:34,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {72769#true} call #t~ret9 := main(); {72769#true} is VALID [2022-04-08 10:09:34,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {72769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72774#(= main_~y~0 0)} is VALID [2022-04-08 10:09:34,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {72774#(= 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; {72775#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:34,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {72775#(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; {72776#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:34,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {72776#(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; {72777#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:34,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {72777#(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; {72778#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:34,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {72778#(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; {72779#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:34,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {72779#(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; {72780#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:34,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {72780#(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; {72781#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:34,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {72781#(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; {72782#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:34,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {72782#(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; {72783#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:34,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {72783#(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; {72784#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:34,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {72784#(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; {72785#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:34,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {72785#(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; {72786#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:34,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {72786#(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; {72787#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:34,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {72787#(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; {72788#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:34,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {72788#(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; {72789#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:34,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {72789#(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; {72790#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:34,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {72790#(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; {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:34,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:34,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {72791#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {72792#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:09:34,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {72792#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72793#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:34,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {72793#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72794#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:09:34,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {72794#(and (<= main_~z~0 15) (<= 15 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; {72881#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:09:34,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {72881#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {72770#false} is VALID [2022-04-08 10:09:34,195 INFO L272 TraceCheckUtils]: 29: Hoare triple {72770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {72770#false} is VALID [2022-04-08 10:09:34,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {72770#false} ~cond := #in~cond; {72770#false} is VALID [2022-04-08 10:09:34,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {72770#false} assume 0 == ~cond; {72770#false} is VALID [2022-04-08 10:09:34,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {72770#false} assume !false; {72770#false} is VALID [2022-04-08 10:09:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:34,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:35,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {72770#false} assume !false; {72770#false} is VALID [2022-04-08 10:09:35,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {72770#false} assume 0 == ~cond; {72770#false} is VALID [2022-04-08 10:09:35,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {72770#false} ~cond := #in~cond; {72770#false} is VALID [2022-04-08 10:09:35,026 INFO L272 TraceCheckUtils]: 29: Hoare triple {72770#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {72770#false} is VALID [2022-04-08 10:09:35,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {72909#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {72770#false} is VALID [2022-04-08 10:09:35,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {72913#(< 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; {72909#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:35,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {72917#(< 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; {72913#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:35,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {72921#(< 0 (mod (+ main_~z~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; {72917#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:35,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {72925#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {72921#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:35,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {72925#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72925#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:35,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {72932#(< 0 (mod (+ main_~y~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; {72925#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:35,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {72936#(< 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; {72932#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:35,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {72940#(< 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; {72936#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:35,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {72944#(< 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; {72940#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:35,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {72948#(< 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; {72944#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:35,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {72952#(< 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; {72948#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:35,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {72956#(< 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; {72952#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:35,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {72960#(< 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; {72956#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:35,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {72964#(< 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; {72960#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:35,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {72968#(< 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; {72964#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:35,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {72972#(< 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; {72968#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:35,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {72976#(< 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; {72972#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:35,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {72980#(< 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; {72976#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:35,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {72984#(< 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; {72980#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:35,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {72988#(< 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; {72984#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:35,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {72992#(< 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; {72988#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:35,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {72996#(< 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; {72992#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:35,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {72769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72996#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:35,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {72769#true} call #t~ret9 := main(); {72769#true} is VALID [2022-04-08 10:09:35,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72769#true} {72769#true} #50#return; {72769#true} is VALID [2022-04-08 10:09:35,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {72769#true} assume true; {72769#true} is VALID [2022-04-08 10:09:35,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {72769#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); {72769#true} is VALID [2022-04-08 10:09:35,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {72769#true} call ULTIMATE.init(); {72769#true} is VALID [2022-04-08 10:09:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:35,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549171938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:35,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:35,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:09:35,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:35,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1191735658] [2022-04-08 10:09:35,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1191735658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:35,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:35,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376829866] [2022-04-08 10:09:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:35,043 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:35,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:35,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:35,064 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:09:35,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:35,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1819, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:09:35,065 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:40,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:40,363 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2022-04-08 10:09:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:09:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 88 transitions. [2022-04-08 10:09:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 88 transitions. [2022-04-08 10:09:40,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 88 transitions. [2022-04-08 10:09:40,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:40,415 INFO L225 Difference]: With dead ends: 127 [2022-04-08 10:09:40,415 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 10:09:40,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1121, Invalid=4579, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:09:40,416 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:40,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 151 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:09:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 10:09:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 55. [2022-04-08 10:09:40,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:40,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,967 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,967 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:40,968 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-08 10:09:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-08 10:09:40,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:40,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:40,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 122 states. [2022-04-08 10:09:40,969 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 122 states. [2022-04-08 10:09:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:40,970 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-08 10:09:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-08 10:09:40,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:40,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:40,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:40,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:09:40,971 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:09:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:40,971 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:09:40,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:40,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:09:42,598 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:09:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:09:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:42,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:42,598 INFO L499 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:42,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:42,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:42,807 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash 399192375, now seen corresponding path program 215 times [2022-04-08 10:09:42,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:42,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777328669] [2022-04-08 10:09:42,814 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:42,814 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 399192375, now seen corresponding path program 216 times [2022-04-08 10:09:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:42,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712614464] [2022-04-08 10:09:42,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:42,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:43,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:43,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {73708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {73681#true} is VALID [2022-04-08 10:09:43,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-08 10:09:43,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-08 10:09:43,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {73681#true} call ULTIMATE.init(); {73708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:43,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {73708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {73681#true} is VALID [2022-04-08 10:09:43,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-08 10:09:43,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-08 10:09:43,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {73681#true} call #t~ret9 := main(); {73681#true} is VALID [2022-04-08 10:09:43,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {73681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73686#(= main_~y~0 0)} is VALID [2022-04-08 10:09:43,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {73686#(= 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; {73687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:43,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {73687#(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; {73688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:43,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {73688#(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; {73689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:43,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {73689#(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; {73690#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:43,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {73690#(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; {73691#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:43,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {73691#(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; {73692#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:43,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {73692#(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; {73693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:43,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {73693#(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; {73694#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:43,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {73694#(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; {73695#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:43,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {73695#(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; {73696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:43,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {73696#(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; {73697#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:43,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {73697#(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; {73698#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:43,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {73698#(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; {73699#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:43,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {73699#(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; {73700#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:43,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {73700#(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; {73701#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:43,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {73701#(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; {73702#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:43,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {73702#(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; {73703#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:43,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {73703#(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; {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:43,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:43,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {73705#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:09:43,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {73705#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73706#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:09:43,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {73706#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73707#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:43,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {73707#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {73682#false} is VALID [2022-04-08 10:09:43,239 INFO L272 TraceCheckUtils]: 29: Hoare triple {73682#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73682#false} is VALID [2022-04-08 10:09:43,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {73682#false} ~cond := #in~cond; {73682#false} is VALID [2022-04-08 10:09:43,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {73682#false} assume 0 == ~cond; {73682#false} is VALID [2022-04-08 10:09:43,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {73682#false} assume !false; {73682#false} is VALID [2022-04-08 10:09:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:43,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712614464] [2022-04-08 10:09:43,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712614464] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:43,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345387203] [2022-04-08 10:09:43,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:43,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:43,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:43,243 INFO L229 MonitoredProcess]: Starting monitored process 128 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:43,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-04-08 10:09:43,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:09:43,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:43,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:09:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:43,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:43,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {73681#true} call ULTIMATE.init(); {73681#true} is VALID [2022-04-08 10:09:43,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {73681#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); {73681#true} is VALID [2022-04-08 10:09:43,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-08 10:09:43,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-08 10:09:43,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {73681#true} call #t~ret9 := main(); {73681#true} is VALID [2022-04-08 10:09:43,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {73681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73686#(= main_~y~0 0)} is VALID [2022-04-08 10:09:43,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {73686#(= 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; {73687#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:43,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {73687#(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; {73688#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:43,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {73688#(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; {73689#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:43,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {73689#(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; {73690#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:43,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {73690#(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; {73691#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:43,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {73691#(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; {73692#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:43,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {73692#(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; {73693#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:43,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {73693#(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; {73694#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:43,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {73694#(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; {73695#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:43,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {73695#(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; {73696#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:43,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {73696#(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; {73697#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:43,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {73697#(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; {73698#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:43,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {73698#(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; {73699#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:43,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {73699#(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; {73700#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:43,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {73700#(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; {73701#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:43,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {73701#(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; {73702#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:43,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {73702#(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; {73703#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:43,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {73703#(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; {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:43,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:43,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {73704#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {73705#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:09:43,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {73705#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73706#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:09:43,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {73706#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73793#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:09:43,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {73793#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {73682#false} is VALID [2022-04-08 10:09:43,765 INFO L272 TraceCheckUtils]: 29: Hoare triple {73682#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73682#false} is VALID [2022-04-08 10:09:43,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {73682#false} ~cond := #in~cond; {73682#false} is VALID [2022-04-08 10:09:43,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {73682#false} assume 0 == ~cond; {73682#false} is VALID [2022-04-08 10:09:43,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {73682#false} assume !false; {73682#false} is VALID [2022-04-08 10:09:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:43,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:44,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {73682#false} assume !false; {73682#false} is VALID [2022-04-08 10:09:44,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {73682#false} assume 0 == ~cond; {73682#false} is VALID [2022-04-08 10:09:44,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {73682#false} ~cond := #in~cond; {73682#false} is VALID [2022-04-08 10:09:44,624 INFO L272 TraceCheckUtils]: 29: Hoare triple {73682#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73682#false} is VALID [2022-04-08 10:09:44,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {73821#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73682#false} is VALID [2022-04-08 10:09:44,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {73825#(< 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; {73821#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:44,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {73829#(< 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; {73825#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:44,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {73833#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {73829#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:44,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {73833#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {73833#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:44,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {73840#(< 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; {73833#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:44,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {73844#(< 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; {73840#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:44,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {73848#(< 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; {73844#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:44,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {73852#(< 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; {73848#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:44,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {73856#(< 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; {73852#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:44,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {73860#(< 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; {73856#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:44,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {73864#(< 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; {73860#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:44,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {73868#(< 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; {73864#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:44,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {73872#(< 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; {73868#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:44,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {73876#(< 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; {73872#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:44,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {73880#(< 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; {73876#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:44,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {73884#(< 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; {73880#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:44,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {73888#(< 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; {73884#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:44,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {73892#(< 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; {73888#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:44,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {73896#(< 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; {73892#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:44,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {73900#(< 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; {73896#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:44,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {73904#(< 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; {73900#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:44,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {73908#(< 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; {73904#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:44,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {73681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73908#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:44,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {73681#true} call #t~ret9 := main(); {73681#true} is VALID [2022-04-08 10:09:44,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73681#true} {73681#true} #50#return; {73681#true} is VALID [2022-04-08 10:09:44,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {73681#true} assume true; {73681#true} is VALID [2022-04-08 10:09:44,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {73681#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); {73681#true} is VALID [2022-04-08 10:09:44,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {73681#true} call ULTIMATE.init(); {73681#true} is VALID [2022-04-08 10:09:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:44,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345387203] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:44,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:44,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:09:44,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:44,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777328669] [2022-04-08 10:09:44,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777328669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:44,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:44,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263822955] [2022-04-08 10:09:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:44,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:44,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:44,657 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:09:44,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:44,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:44,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1790, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:09:44,658 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:50,861 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2022-04-08 10:09:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:09:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:50,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2022-04-08 10:09:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 90 transitions. [2022-04-08 10:09:50,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 90 transitions. [2022-04-08 10:09:50,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:50,936 INFO L225 Difference]: With dead ends: 131 [2022-04-08 10:09:50,936 INFO L226 Difference]: Without dead ends: 126 [2022-04-08 10:09:50,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1074, Invalid=4182, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:09:50,937 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:50,937 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 151 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:09:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-08 10:09:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 55. [2022-04-08 10:09:51,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:51,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:51,687 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:51,687 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:51,688 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-04-08 10:09:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2022-04-08 10:09:51,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:51,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:51,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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:09:51,688 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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:09:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:51,689 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2022-04-08 10:09:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2022-04-08 10:09:51,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:51,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:51,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:51,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:09:51,690 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:09:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:51,690 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:09:51,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:51,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:09:53,520 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:09:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:09:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:09:53,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:53,521 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:53,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:53,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:53,721 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash -185275210, now seen corresponding path program 217 times [2022-04-08 10:09:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:53,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1815675678] [2022-04-08 10:09:53,725 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:53,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -185275210, now seen corresponding path program 218 times [2022-04-08 10:09:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:53,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679503353] [2022-04-08 10:09:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:54,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:54,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {74630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {74603#true} is VALID [2022-04-08 10:09:54,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-08 10:09:54,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-08 10:09:54,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {74603#true} call ULTIMATE.init(); {74630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:54,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {74630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {74603#true} is VALID [2022-04-08 10:09:54,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-08 10:09:54,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-08 10:09:54,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {74603#true} call #t~ret9 := main(); {74603#true} is VALID [2022-04-08 10:09:54,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {74603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74608#(= main_~y~0 0)} is VALID [2022-04-08 10:09:54,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {74608#(= 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; {74609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:54,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {74609#(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; {74610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:54,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {74610#(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; {74611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:54,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {74611#(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; {74612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:54,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {74612#(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; {74613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:54,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {74613#(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; {74614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:54,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {74614#(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; {74615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:54,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {74615#(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; {74616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:54,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {74616#(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; {74617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:54,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {74617#(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; {74618#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:54,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {74618#(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; {74619#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:54,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {74619#(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; {74620#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:54,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {74620#(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; {74621#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:54,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {74621#(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; {74622#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:54,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {74622#(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; {74623#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:54,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {74623#(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; {74624#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:54,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {74624#(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; {74625#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:54,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {74625#(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; {74626#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:54,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {74626#(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; {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:54,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:54,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {74628#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:09:54,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {74628#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74629#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-08 10:09:54,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {74629#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {74604#false} is VALID [2022-04-08 10:09:54,091 INFO L272 TraceCheckUtils]: 29: Hoare triple {74604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74604#false} is VALID [2022-04-08 10:09:54,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {74604#false} ~cond := #in~cond; {74604#false} is VALID [2022-04-08 10:09:54,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {74604#false} assume 0 == ~cond; {74604#false} is VALID [2022-04-08 10:09:54,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {74604#false} assume !false; {74604#false} is VALID [2022-04-08 10:09:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:54,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679503353] [2022-04-08 10:09:54,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679503353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:54,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774354289] [2022-04-08 10:09:54,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:09:54,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:54,094 INFO L229 MonitoredProcess]: Starting monitored process 129 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:54,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-04-08 10:09:54,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:09:54,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:54,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:09:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:54,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:54,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {74603#true} call ULTIMATE.init(); {74603#true} is VALID [2022-04-08 10:09:54,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {74603#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); {74603#true} is VALID [2022-04-08 10:09:54,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-08 10:09:54,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-08 10:09:54,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {74603#true} call #t~ret9 := main(); {74603#true} is VALID [2022-04-08 10:09:54,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {74603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74608#(= main_~y~0 0)} is VALID [2022-04-08 10:09:54,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {74608#(= 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; {74609#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:54,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {74609#(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; {74610#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:54,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {74610#(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; {74611#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:54,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {74611#(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; {74612#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:54,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {74612#(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; {74613#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:54,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {74613#(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; {74614#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:54,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {74614#(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; {74615#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:54,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {74615#(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; {74616#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:54,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {74616#(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; {74617#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:54,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {74617#(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; {74618#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:54,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {74618#(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; {74619#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:54,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {74619#(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; {74620#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:54,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {74620#(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; {74621#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:54,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {74621#(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; {74622#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:54,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {74622#(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; {74623#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:54,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {74623#(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; {74624#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:54,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {74624#(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; {74625#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:54,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {74625#(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; {74626#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:54,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {74626#(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; {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:54,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:54,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {74627#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {74628#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:09:54,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {74628#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74715#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:09:54,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {74715#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {74604#false} is VALID [2022-04-08 10:09:54,378 INFO L272 TraceCheckUtils]: 29: Hoare triple {74604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74604#false} is VALID [2022-04-08 10:09:54,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {74604#false} ~cond := #in~cond; {74604#false} is VALID [2022-04-08 10:09:54,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {74604#false} assume 0 == ~cond; {74604#false} is VALID [2022-04-08 10:09:54,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {74604#false} assume !false; {74604#false} is VALID [2022-04-08 10:09:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:54,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:55,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {74604#false} assume !false; {74604#false} is VALID [2022-04-08 10:09:55,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {74604#false} assume 0 == ~cond; {74604#false} is VALID [2022-04-08 10:09:55,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {74604#false} ~cond := #in~cond; {74604#false} is VALID [2022-04-08 10:09:55,045 INFO L272 TraceCheckUtils]: 29: Hoare triple {74604#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74604#false} is VALID [2022-04-08 10:09:55,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {74743#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {74604#false} is VALID [2022-04-08 10:09:55,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {74747#(< 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; {74743#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:55,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {74751#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {74747#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:55,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {74751#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {74751#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:55,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {74758#(< 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; {74751#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:55,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {74762#(< 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; {74758#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:55,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {74766#(< 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; {74762#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:55,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {74770#(< 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; {74766#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:55,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {74774#(< 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; {74770#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:55,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {74778#(< 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; {74774#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:55,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {74782#(< 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; {74778#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:55,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {74786#(< 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; {74782#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:55,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {74790#(< 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; {74786#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:55,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {74794#(< 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; {74790#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:55,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {74798#(< 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; {74794#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:55,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {74802#(< 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; {74798#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:55,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {74806#(< 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; {74802#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:55,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {74810#(< 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; {74806#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:55,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {74814#(< 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; {74810#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:55,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {74818#(< 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; {74814#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:55,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {74822#(< 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; {74818#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:55,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {74826#(< 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; {74822#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:55,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {74830#(< 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; {74826#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:09:55,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {74603#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74830#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:09:55,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {74603#true} call #t~ret9 := main(); {74603#true} is VALID [2022-04-08 10:09:55,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74603#true} {74603#true} #50#return; {74603#true} is VALID [2022-04-08 10:09:55,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {74603#true} assume true; {74603#true} is VALID [2022-04-08 10:09:55,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {74603#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); {74603#true} is VALID [2022-04-08 10:09:55,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {74603#true} call ULTIMATE.init(); {74603#true} is VALID [2022-04-08 10:09:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:55,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774354289] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:55,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:55,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:09:55,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:55,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1815675678] [2022-04-08 10:09:55,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1815675678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:55,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:55,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:09:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683266035] [2022-04-08 10:09:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:55,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:55,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:09:55,075 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:09:55,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:09:55,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:09:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1757, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:09:55,075 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:00,417 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2022-04-08 10:10:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:10:00,417 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 93 transitions. [2022-04-08 10:10:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 93 transitions. [2022-04-08 10:10:00,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 93 transitions. [2022-04-08 10:10:00,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:00,470 INFO L225 Difference]: With dead ends: 134 [2022-04-08 10:10:00,470 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 10:10:00,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1063, Invalid=3907, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:10:00,470 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 77 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:00,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 161 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:10:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 10:10:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 55. [2022-04-08 10:10:01,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:01,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:01,055 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:01,055 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:01,056 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-04-08 10:10:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-04-08 10:10:01,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:01,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:01,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 129 states. [2022-04-08 10:10:01,056 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 129 states. [2022-04-08 10:10:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:01,057 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-04-08 10:10:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-04-08 10:10:01,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:01,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:01,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:01,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:10:01,058 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 33 [2022-04-08 10:10:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:01,058 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:10:01,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:01,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:10:02,759 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:10:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:10:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:10:02,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:02,760 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:02,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:02,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-04-08 10:10:02,960 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:02,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2012628311, now seen corresponding path program 39 times [2022-04-08 10:10:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:02,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8285496] [2022-04-08 10:10:02,962 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:02,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2012628311, now seen corresponding path program 40 times [2022-04-08 10:10:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:02,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162242224] [2022-04-08 10:10:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:03,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:03,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {75560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {75533#true} is VALID [2022-04-08 10:10:03,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-08 10:10:03,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-08 10:10:03,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {75533#true} call ULTIMATE.init(); {75560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:03,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {75560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {75533#true} is VALID [2022-04-08 10:10:03,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-08 10:10:03,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-08 10:10:03,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {75533#true} call #t~ret9 := main(); {75533#true} is VALID [2022-04-08 10:10:03,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {75533#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75538#(= main_~y~0 0)} is VALID [2022-04-08 10:10:03,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {75538#(= 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; {75539#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:03,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {75539#(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; {75540#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:03,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {75540#(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; {75541#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:03,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {75541#(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; {75542#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:03,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {75542#(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; {75543#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:03,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {75543#(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; {75544#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:03,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {75544#(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; {75545#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:03,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {75545#(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; {75546#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:03,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {75546#(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; {75547#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:03,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {75547#(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; {75548#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:03,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {75548#(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; {75549#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:03,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {75549#(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; {75550#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:03,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {75550#(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; {75551#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:03,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {75551#(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; {75552#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:03,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {75552#(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; {75553#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:03,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {75553#(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; {75554#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:03,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {75554#(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; {75555#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:03,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {75555#(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; {75556#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:03,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {75556#(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; {75557#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:03,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {75557#(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; {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:10:03,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:10:03,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {75559#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-08 10:10:03,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {75559#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75534#false} is VALID [2022-04-08 10:10:03,330 INFO L272 TraceCheckUtils]: 29: Hoare triple {75534#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75534#false} is VALID [2022-04-08 10:10:03,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {75534#false} ~cond := #in~cond; {75534#false} is VALID [2022-04-08 10:10:03,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {75534#false} assume 0 == ~cond; {75534#false} is VALID [2022-04-08 10:10:03,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {75534#false} assume !false; {75534#false} is VALID [2022-04-08 10:10:03,330 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:10:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162242224] [2022-04-08 10:10:03,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162242224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566120089] [2022-04-08 10:10:03,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:03,332 INFO L229 MonitoredProcess]: Starting monitored process 130 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:03,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-04-08 10:10:03,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:03,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:03,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:10:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:03,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:03,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {75533#true} call ULTIMATE.init(); {75533#true} is VALID [2022-04-08 10:10:03,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {75533#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); {75533#true} is VALID [2022-04-08 10:10:03,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-08 10:10:03,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-08 10:10:03,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {75533#true} call #t~ret9 := main(); {75533#true} is VALID [2022-04-08 10:10:03,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {75533#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75538#(= main_~y~0 0)} is VALID [2022-04-08 10:10:03,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {75538#(= 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; {75539#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:03,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {75539#(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; {75540#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:03,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {75540#(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; {75541#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:03,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {75541#(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; {75542#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:03,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {75542#(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; {75543#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:03,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {75543#(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; {75544#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:03,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {75544#(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; {75545#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:03,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {75545#(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; {75546#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:03,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {75546#(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; {75547#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:03,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {75547#(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; {75548#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:03,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {75548#(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; {75549#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:03,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {75549#(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; {75550#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:03,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {75550#(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; {75551#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:03,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {75551#(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; {75552#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:03,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {75552#(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; {75553#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:03,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {75553#(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; {75554#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:10:03,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {75554#(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; {75555#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:10:03,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {75555#(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; {75556#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:10:03,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {75556#(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; {75557#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:10:03,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {75557#(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; {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:10:03,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:10:03,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {75558#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {75645#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:10:03,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {75645#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75534#false} is VALID [2022-04-08 10:10:03,691 INFO L272 TraceCheckUtils]: 29: Hoare triple {75534#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75534#false} is VALID [2022-04-08 10:10:03,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {75534#false} ~cond := #in~cond; {75534#false} is VALID [2022-04-08 10:10:03,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {75534#false} assume 0 == ~cond; {75534#false} is VALID [2022-04-08 10:10:03,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {75534#false} assume !false; {75534#false} is VALID [2022-04-08 10:10:03,692 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:10:03,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:04,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {75534#false} assume !false; {75534#false} is VALID [2022-04-08 10:10:04,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {75534#false} assume 0 == ~cond; {75534#false} is VALID [2022-04-08 10:10:04,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {75534#false} ~cond := #in~cond; {75534#false} is VALID [2022-04-08 10:10:04,492 INFO L272 TraceCheckUtils]: 29: Hoare triple {75534#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75534#false} is VALID [2022-04-08 10:10:04,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {75673#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75534#false} is VALID [2022-04-08 10:10:04,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {75677#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {75673#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:04,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {75677#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {75677#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:04,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {75684#(< 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; {75677#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:04,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {75688#(< 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; {75684#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:04,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {75692#(< 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; {75688#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:04,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {75696#(< 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; {75692#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:04,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {75700#(< 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; {75696#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:04,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {75704#(< 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; {75700#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {75708#(< 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; {75704#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:04,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {75712#(< 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; {75708#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {75716#(< 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; {75712#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:04,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {75720#(< 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; {75716#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:04,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {75724#(< 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; {75720#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:10:04,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {75728#(< 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; {75724#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:10:04,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {75732#(< 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; {75728#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:10:04,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {75736#(< 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; {75732#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:10:04,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {75740#(< 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; {75736#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:10:04,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {75744#(< 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; {75740#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:10:04,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {75748#(< 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; {75744#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:10:04,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {75752#(< 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; {75748#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:10:04,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {75756#(< 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; {75752#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:10:04,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {75760#(< 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; {75756#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:04,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {75533#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75760#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:10:04,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {75533#true} call #t~ret9 := main(); {75533#true} is VALID [2022-04-08 10:10:04,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75533#true} {75533#true} #50#return; {75533#true} is VALID [2022-04-08 10:10:04,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {75533#true} assume true; {75533#true} is VALID [2022-04-08 10:10:04,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {75533#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); {75533#true} is VALID [2022-04-08 10:10:04,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {75533#true} call ULTIMATE.init(); {75533#true} is VALID [2022-04-08 10:10:04,508 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:10:04,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566120089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:04,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:04,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:10:04,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:04,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8285496] [2022-04-08 10:10:04,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8285496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:04,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:04,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:10:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288321348] [2022-04-08 10:10:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:04,509 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:04,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:04,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:04,530 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:04,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:10:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:10:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:10:04,531 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:10,211 INFO L93 Difference]: Finished difference Result 139 states and 162 transitions. [2022-04-08 10:10:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:10:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 97 transitions. [2022-04-08 10:10:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 97 transitions. [2022-04-08 10:10:10,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 97 transitions. [2022-04-08 10:10:10,274 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:10,276 INFO L225 Difference]: With dead ends: 139 [2022-04-08 10:10:10,276 INFO L226 Difference]: Without dead ends: 134 [2022-04-08 10:10:10,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:10:10,276 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 96 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:10,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 164 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:10:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-08 10:10:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 57. [2022-04-08 10:10:10,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:10,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call 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,991 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call 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,991 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call 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,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:10,993 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 10:10:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 10:10:10,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:10,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:10,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 3 states have call successors, (3), 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 134 states. [2022-04-08 10:10:10,993 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 3 states have call successors, (3), 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 134 states. [2022-04-08 10:10:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:10,994 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2022-04-08 10:10:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2022-04-08 10:10:10,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:10,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:10,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:10,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call 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,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-04-08 10:10:10,995 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 33 [2022-04-08 10:10:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:10,995 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-04-08 10:10:10,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 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:10,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 69 transitions. [2022-04-08 10:10:12,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-08 10:10:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:12,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:12,705 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:12,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:12,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable130 [2022-04-08 10:10:12,920 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1325645685, now seen corresponding path program 219 times [2022-04-08 10:10:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:12,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161191535] [2022-04-08 10:10:12,922 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:12,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1325645685, now seen corresponding path program 220 times [2022-04-08 10:10:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:12,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809735543] [2022-04-08 10:10:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:13,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {76512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {76485#true} is VALID [2022-04-08 10:10:13,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-08 10:10:13,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-08 10:10:13,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {76485#true} call ULTIMATE.init(); {76512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:13,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {76512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {76485#true} is VALID [2022-04-08 10:10:13,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-08 10:10:13,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-08 10:10:13,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {76485#true} call #t~ret9 := main(); {76485#true} is VALID [2022-04-08 10:10:13,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {76485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76490#(= main_~y~0 0)} is VALID [2022-04-08 10:10:13,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {76490#(= 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; {76491#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:13,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {76491#(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; {76492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:13,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {76492#(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; {76493#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:13,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {76493#(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; {76494#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:13,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {76494#(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; {76495#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:13,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {76495#(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; {76496#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:13,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {76496#(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; {76497#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:13,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {76497#(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; {76498#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:13,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {76498#(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; {76499#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:13,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {76499#(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; {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:13,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:13,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {76501#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:13,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {76501#(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; {76502#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:13,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {76502#(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; {76503#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:13,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {76503#(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; {76504#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:13,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {76504#(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; {76505#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:13,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {76505#(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; {76506#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:13,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {76506#(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; {76507#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:13,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {76507#(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; {76508#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:13,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {76508#(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; {76509#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:13,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {76509#(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; {76510#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:13,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {76510#(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; {76511#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:10:13,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {76511#(and (<= main_~z~0 0) (<= 0 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; {76486#false} is VALID [2022-04-08 10:10:13,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {76486#false} assume !(~z~0 % 4294967296 > 0); {76486#false} is VALID [2022-04-08 10:10:13,327 INFO L272 TraceCheckUtils]: 30: Hoare triple {76486#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76486#false} is VALID [2022-04-08 10:10:13,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {76486#false} ~cond := #in~cond; {76486#false} is VALID [2022-04-08 10:10:13,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {76486#false} assume 0 == ~cond; {76486#false} is VALID [2022-04-08 10:10:13,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {76486#false} assume !false; {76486#false} is VALID [2022-04-08 10:10:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:13,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809735543] [2022-04-08 10:10:13,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809735543] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:13,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057932943] [2022-04-08 10:10:13,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:13,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:13,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:13,328 INFO L229 MonitoredProcess]: Starting monitored process 131 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:13,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-04-08 10:10:13,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:13,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:13,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:10:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:13,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:13,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {76485#true} call ULTIMATE.init(); {76485#true} is VALID [2022-04-08 10:10:13,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {76485#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); {76485#true} is VALID [2022-04-08 10:10:13,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-08 10:10:13,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-08 10:10:13,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {76485#true} call #t~ret9 := main(); {76485#true} is VALID [2022-04-08 10:10:13,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {76485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76490#(= main_~y~0 0)} is VALID [2022-04-08 10:10:13,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {76490#(= 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; {76491#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:13,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {76491#(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; {76492#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:13,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {76492#(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; {76493#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:13,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {76493#(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; {76494#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:13,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {76494#(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; {76495#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:13,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {76495#(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; {76496#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:13,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {76496#(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; {76497#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:13,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {76497#(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; {76498#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:13,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {76498#(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; {76499#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:13,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {76499#(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; {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:13,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:13,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {76500#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {76501#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:13,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {76501#(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; {76502#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:13,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {76502#(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; {76503#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:13,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {76503#(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; {76504#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:13,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {76504#(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; {76505#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:13,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {76505#(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; {76506#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:13,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {76506#(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; {76507#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:13,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {76507#(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; {76508#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:13,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {76508#(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; {76509#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:13,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {76509#(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; {76510#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:13,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {76510#(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; {76511#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:10:13,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {76511#(and (<= main_~z~0 0) (<= 0 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; {76600#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:10:13,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {76600#(and (<= (+ main_~z~0 1) 0) (<= 0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {76486#false} is VALID [2022-04-08 10:10:13,758 INFO L272 TraceCheckUtils]: 30: Hoare triple {76486#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76486#false} is VALID [2022-04-08 10:10:13,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {76486#false} ~cond := #in~cond; {76486#false} is VALID [2022-04-08 10:10:13,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {76486#false} assume 0 == ~cond; {76486#false} is VALID [2022-04-08 10:10:13,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {76486#false} assume !false; {76486#false} is VALID [2022-04-08 10:10:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:13,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:14,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {76486#false} assume !false; {76486#false} is VALID [2022-04-08 10:10:14,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {76486#false} assume 0 == ~cond; {76486#false} is VALID [2022-04-08 10:10:14,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {76486#false} ~cond := #in~cond; {76486#false} is VALID [2022-04-08 10:10:14,608 INFO L272 TraceCheckUtils]: 30: Hoare triple {76486#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76486#false} is VALID [2022-04-08 10:10:14,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {76628#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {76486#false} is VALID [2022-04-08 10:10:14,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {76632#(< 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; {76628#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:14,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {76636#(< 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; {76632#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:14,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {76640#(< 0 (mod (+ main_~z~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; {76636#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:14,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {76644#(< 0 (mod (+ 4294967292 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; {76640#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:14,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {76648#(< 0 (mod (+ 4294967291 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; {76644#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:14,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {76652#(< 0 (mod (+ 4294967290 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; {76648#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:14,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {76656#(< 0 (mod (+ main_~z~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; {76652#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:14,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {76660#(< 0 (mod (+ 4294967288 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; {76656#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:14,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {76664#(< 0 (mod (+ main_~z~0 4294967287) 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; {76660#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:14,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {76668#(< 0 (mod (+ main_~z~0 4294967286) 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; {76664#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:10:14,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {76672#(< 0 (mod (+ main_~z~0 4294967285) 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; {76668#(< 0 (mod (+ main_~z~0 4294967286) 4294967296))} is VALID [2022-04-08 10:10:14,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {76676#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} ~z~0 := ~y~0; {76672#(< 0 (mod (+ main_~z~0 4294967285) 4294967296))} is VALID [2022-04-08 10:10:14,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {76676#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} assume !(~x~0 % 4294967296 > 0); {76676#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-08 10:10:14,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {76683#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76676#(< 0 (mod (+ main_~y~0 4294967285) 4294967296))} is VALID [2022-04-08 10:10:14,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {76687#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76683#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:10:14,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {76691#(< 0 (mod (+ 4294967288 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; {76687#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:10:14,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {76695#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {76691#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:14,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {76699#(< 0 (mod (+ 4294967290 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; {76695#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:14,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {76703#(< 0 (mod (+ 4294967291 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; {76699#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:14,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {76707#(< 0 (mod (+ 4294967292 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; {76703#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:14,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {76711#(< 0 (mod (+ main_~y~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; {76707#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:14,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {76715#(< 0 (mod (+ main_~y~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; {76711#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:14,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {76719#(< 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; {76715#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:14,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {76485#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76719#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:14,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {76485#true} call #t~ret9 := main(); {76485#true} is VALID [2022-04-08 10:10:14,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76485#true} {76485#true} #50#return; {76485#true} is VALID [2022-04-08 10:10:14,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {76485#true} assume true; {76485#true} is VALID [2022-04-08 10:10:14,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {76485#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); {76485#true} is VALID [2022-04-08 10:10:14,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {76485#true} call ULTIMATE.init(); {76485#true} is VALID [2022-04-08 10:10:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:14,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057932943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:14,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:14,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-04-08 10:10:14,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:14,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161191535] [2022-04-08 10:10:14,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161191535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:14,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:14,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:10:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651965409] [2022-04-08 10:10:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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:14,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:14,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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:14,643 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:14,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:10:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:10:14,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:10:14,644 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:16,804 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-08 10:10:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:10:16,804 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2022-04-08 10:10:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2022-04-08 10:10:16,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 45 transitions. [2022-04-08 10:10:16,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:16,828 INFO L225 Difference]: With dead ends: 73 [2022-04-08 10:10:16,828 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 10:10:16,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=791, Invalid=4179, Unknown=0, NotChecked=0, Total=4970 [2022-04-08 10:10:16,828 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:16,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 124 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:10:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 10:10:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 10:10:17,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:17,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,355 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,355 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:17,355 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-04-08 10:10:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:10:17,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:17,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:17,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 55 states. [2022-04-08 10:10:17,356 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 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 55 states. [2022-04-08 10:10:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:17,356 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-04-08 10:10:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:10:17,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:17,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:17,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:17,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call 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,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-08 10:10:17,357 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 34 [2022-04-08 10:10:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:17,357 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-08 10:10:17,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 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:17,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 66 transitions. [2022-04-08 10:10:18,980 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:10:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-08 10:10:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:18,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:18,981 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:18,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:19,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:19,186 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1745093612, now seen corresponding path program 221 times [2022-04-08 10:10:19,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:19,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [653139787] [2022-04-08 10:10:19,188 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:19,189 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1745093612, now seen corresponding path program 222 times [2022-04-08 10:10:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:19,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537203428] [2022-04-08 10:10:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:19,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {77178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {77150#true} is VALID [2022-04-08 10:10:19,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-08 10:10:19,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-08 10:10:19,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {77150#true} call ULTIMATE.init(); {77178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:19,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {77178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {77150#true} is VALID [2022-04-08 10:10:19,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-08 10:10:19,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-08 10:10:19,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {77150#true} call #t~ret9 := main(); {77150#true} is VALID [2022-04-08 10:10:19,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {77150#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77155#(= main_~y~0 0)} is VALID [2022-04-08 10:10:19,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {77155#(= 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; {77156#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:19,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {77156#(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; {77157#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:19,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {77157#(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; {77158#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:19,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {77158#(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; {77159#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:19,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {77159#(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; {77160#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:19,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {77160#(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; {77161#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:19,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {77161#(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; {77162#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:19,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {77162#(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; {77163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:19,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {77163#(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; {77164#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:19,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {77164#(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; {77165#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:19,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {77165#(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; {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:19,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:19,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {77167#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:19,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {77167#(and (<= main_~z~0 11) (<= 11 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; {77168#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:19,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {77168#(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; {77169#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:19,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {77169#(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; {77170#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:19,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {77170#(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; {77171#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:19,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {77171#(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; {77172#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:19,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {77172#(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; {77173#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:19,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {77173#(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; {77174#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:19,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {77174#(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; {77175#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:19,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {77175#(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; {77176#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:19,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {77176#(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; {77177#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:19,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {77177#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {77151#false} is VALID [2022-04-08 10:10:19,631 INFO L272 TraceCheckUtils]: 30: Hoare triple {77151#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77151#false} is VALID [2022-04-08 10:10:19,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {77151#false} ~cond := #in~cond; {77151#false} is VALID [2022-04-08 10:10:19,631 INFO L290 TraceCheckUtils]: 32: Hoare triple {77151#false} assume 0 == ~cond; {77151#false} is VALID [2022-04-08 10:10:19,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {77151#false} assume !false; {77151#false} is VALID [2022-04-08 10:10:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:19,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:19,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537203428] [2022-04-08 10:10:19,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537203428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:19,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24206275] [2022-04-08 10:10:19,632 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:19,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:19,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:19,633 INFO L229 MonitoredProcess]: Starting monitored process 132 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,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-04-08 10:10:19,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:10:19,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:19,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:10:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:19,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:20,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {77150#true} call ULTIMATE.init(); {77150#true} is VALID [2022-04-08 10:10:20,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {77150#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); {77150#true} is VALID [2022-04-08 10:10:20,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-08 10:10:20,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-08 10:10:20,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {77150#true} call #t~ret9 := main(); {77150#true} is VALID [2022-04-08 10:10:20,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {77150#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77155#(= main_~y~0 0)} is VALID [2022-04-08 10:10:20,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {77155#(= 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; {77156#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:20,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {77156#(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; {77157#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:20,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {77157#(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; {77158#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:20,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {77158#(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; {77159#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:20,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {77159#(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; {77160#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:20,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {77160#(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; {77161#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:20,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {77161#(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; {77162#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:20,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {77162#(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; {77163#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:20,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {77163#(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; {77164#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:20,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {77164#(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; {77165#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:20,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {77165#(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; {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:20,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:20,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {77166#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {77167#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:20,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {77167#(and (<= main_~z~0 11) (<= 11 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; {77168#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:20,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {77168#(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; {77169#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:20,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {77169#(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; {77170#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:20,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {77170#(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; {77171#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:20,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {77171#(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; {77172#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:20,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {77172#(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; {77173#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:20,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {77173#(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; {77174#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:20,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {77174#(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; {77175#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:20,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {77175#(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; {77176#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:10:20,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {77176#(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; {77266#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:10:20,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {77266#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {77151#false} is VALID [2022-04-08 10:10:20,167 INFO L272 TraceCheckUtils]: 30: Hoare triple {77151#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77151#false} is VALID [2022-04-08 10:10:20,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {77151#false} ~cond := #in~cond; {77151#false} is VALID [2022-04-08 10:10:20,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {77151#false} assume 0 == ~cond; {77151#false} is VALID [2022-04-08 10:10:20,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {77151#false} assume !false; {77151#false} is VALID [2022-04-08 10:10:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:20,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:21,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {77151#false} assume !false; {77151#false} is VALID [2022-04-08 10:10:21,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {77151#false} assume 0 == ~cond; {77151#false} is VALID [2022-04-08 10:10:21,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {77151#false} ~cond := #in~cond; {77151#false} is VALID [2022-04-08 10:10:21,070 INFO L272 TraceCheckUtils]: 30: Hoare triple {77151#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77151#false} is VALID [2022-04-08 10:10:21,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {77294#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {77151#false} is VALID [2022-04-08 10:10:21,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {77298#(< 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; {77294#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:21,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {77302#(< 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; {77298#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:21,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {77306#(< 0 (mod (+ main_~z~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; {77302#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:21,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {77310#(< 0 (mod (+ 4294967292 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; {77306#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:21,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {77314#(< 0 (mod (+ 4294967291 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; {77310#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:21,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {77318#(< 0 (mod (+ 4294967290 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; {77314#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:21,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {77322#(< 0 (mod (+ main_~z~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; {77318#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:21,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {77326#(< 0 (mod (+ 4294967288 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; {77322#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:21,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {77330#(< 0 (mod (+ main_~z~0 4294967287) 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; {77326#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:21,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {77334#(< 0 (mod (+ main_~z~0 4294967286) 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; {77330#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:10:21,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {77338#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} ~z~0 := ~y~0; {77334#(< 0 (mod (+ main_~z~0 4294967286) 4294967296))} is VALID [2022-04-08 10:10:21,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {77338#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} assume !(~x~0 % 4294967296 > 0); {77338#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:10:21,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {77345#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77338#(< 0 (mod (+ main_~y~0 4294967286) 4294967296))} is VALID [2022-04-08 10:10:21,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {77349#(< 0 (mod (+ 4294967288 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; {77345#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:10:21,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {77353#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {77349#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:21,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {77357#(< 0 (mod (+ 4294967290 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; {77353#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:21,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {77361#(< 0 (mod (+ 4294967291 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; {77357#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:21,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {77365#(< 0 (mod (+ 4294967292 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; {77361#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:21,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {77369#(< 0 (mod (+ main_~y~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; {77365#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:21,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {77373#(< 0 (mod (+ main_~y~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; {77369#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:21,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {77377#(< 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; {77373#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:21,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {77381#(< 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; {77377#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:21,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {77385#(< 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; {77381#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:21,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {77150#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77385#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:21,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {77150#true} call #t~ret9 := main(); {77150#true} is VALID [2022-04-08 10:10:21,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77150#true} {77150#true} #50#return; {77150#true} is VALID [2022-04-08 10:10:21,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {77150#true} assume true; {77150#true} is VALID [2022-04-08 10:10:21,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {77150#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); {77150#true} is VALID [2022-04-08 10:10:21,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {77150#true} call ULTIMATE.init(); {77150#true} is VALID [2022-04-08 10:10:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:21,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24206275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:21,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:21,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:10:21,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:21,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [653139787] [2022-04-08 10:10:21,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [653139787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:21,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:21,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:10:21,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017496510] [2022-04-08 10:10:21,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:21,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:21,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:21,114 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:21,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:10:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:10:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=2097, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:10:21,115 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:23,823 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-04-08 10:10:23,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:10:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2022-04-08 10:10:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2022-04-08 10:10:23,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 48 transitions. [2022-04-08 10:10:23,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:23,853 INFO L225 Difference]: With dead ends: 72 [2022-04-08 10:10:23,853 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 10:10:23,853 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=854, Invalid=4402, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:10:23,854 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:23,854 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:10:23,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 10:10:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-08 10:10:24,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:24,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:24,619 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:24,619 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:24,620 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-08 10:10:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 10:10:24,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:24,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:24,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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:10:24,620 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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:10:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:24,621 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-08 10:10:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-08 10:10:24,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:24,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:24,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:24,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:10:24,621 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:10:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:24,622 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:10:24,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:24,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:10:26,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:10:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:26,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:26,475 INFO L499 BasicCegarLoop]: trace histogram [12, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:26,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2022-04-08 10:10:26,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:26,684 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:26,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1758080917, now seen corresponding path program 223 times [2022-04-08 10:10:26,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:26,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [20875077] [2022-04-08 10:10:26,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:26,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1758080917, now seen corresponding path program 224 times [2022-04-08 10:10:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73436045] [2022-04-08 10:10:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:27,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:27,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {77870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {77842#true} is VALID [2022-04-08 10:10:27,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-08 10:10:27,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-08 10:10:27,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {77842#true} call ULTIMATE.init(); {77870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:27,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {77870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {77842#true} is VALID [2022-04-08 10:10:27,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-08 10:10:27,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-08 10:10:27,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {77842#true} call #t~ret9 := main(); {77842#true} is VALID [2022-04-08 10:10:27,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {77842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77847#(= main_~y~0 0)} is VALID [2022-04-08 10:10:27,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {77847#(= 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; {77848#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:27,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {77848#(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; {77849#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:27,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {77849#(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; {77850#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:27,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {77850#(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; {77851#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:27,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {77851#(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; {77852#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:27,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {77852#(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; {77853#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:27,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {77853#(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; {77854#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {77854#(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; {77855#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:27,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {77855#(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; {77856#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:27,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {77856#(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; {77857#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:27,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {77857#(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; {77858#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:27,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {77858#(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; {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:27,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:27,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {77860#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:27,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {77860#(and (<= main_~z~0 12) (<= 12 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; {77861#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:27,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {77861#(and (<= main_~z~0 11) (<= 11 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; {77862#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:27,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {77862#(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; {77863#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:27,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {77863#(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; {77864#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:27,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {77864#(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; {77865#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:27,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {77865#(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; {77866#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:27,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {77866#(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; {77867#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:27,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {77867#(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; {77868#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:27,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {77868#(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; {77869#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:27,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {77869#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {77843#false} is VALID [2022-04-08 10:10:27,167 INFO L272 TraceCheckUtils]: 30: Hoare triple {77843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77843#false} is VALID [2022-04-08 10:10:27,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {77843#false} ~cond := #in~cond; {77843#false} is VALID [2022-04-08 10:10:27,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {77843#false} assume 0 == ~cond; {77843#false} is VALID [2022-04-08 10:10:27,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {77843#false} assume !false; {77843#false} is VALID [2022-04-08 10:10:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73436045] [2022-04-08 10:10:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73436045] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995535613] [2022-04-08 10:10:27,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:27,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:27,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:27,169 INFO L229 MonitoredProcess]: Starting monitored process 133 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:27,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-04-08 10:10:27,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:27,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:27,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:10:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:27,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:27,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {77842#true} call ULTIMATE.init(); {77842#true} is VALID [2022-04-08 10:10:27,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {77842#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); {77842#true} is VALID [2022-04-08 10:10:27,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-08 10:10:27,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-08 10:10:27,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {77842#true} call #t~ret9 := main(); {77842#true} is VALID [2022-04-08 10:10:27,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {77842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {77847#(= main_~y~0 0)} is VALID [2022-04-08 10:10:27,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {77847#(= 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; {77848#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:27,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {77848#(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; {77849#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:27,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {77849#(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; {77850#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:27,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {77850#(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; {77851#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:27,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {77851#(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; {77852#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:27,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {77852#(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; {77853#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:27,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {77853#(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; {77854#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:27,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {77854#(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; {77855#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:27,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {77855#(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; {77856#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:27,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {77856#(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; {77857#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:27,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {77857#(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; {77858#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:27,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {77858#(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; {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:27,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:27,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {77859#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {77860#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:27,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {77860#(and (<= main_~z~0 12) (<= 12 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; {77861#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:27,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {77861#(and (<= main_~z~0 11) (<= 11 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; {77862#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:27,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {77862#(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; {77863#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:27,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {77863#(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; {77864#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:27,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {77864#(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; {77865#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:27,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {77865#(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; {77866#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:27,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {77866#(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; {77867#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:27,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {77867#(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; {77868#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:10:27,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {77868#(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; {77958#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:10:27,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {77958#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {77843#false} is VALID [2022-04-08 10:10:27,541 INFO L272 TraceCheckUtils]: 30: Hoare triple {77843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77843#false} is VALID [2022-04-08 10:10:27,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {77843#false} ~cond := #in~cond; {77843#false} is VALID [2022-04-08 10:10:27,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {77843#false} assume 0 == ~cond; {77843#false} is VALID [2022-04-08 10:10:27,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {77843#false} assume !false; {77843#false} is VALID [2022-04-08 10:10:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:27,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:28,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {77843#false} assume !false; {77843#false} is VALID [2022-04-08 10:10:28,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {77843#false} assume 0 == ~cond; {77843#false} is VALID [2022-04-08 10:10:28,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {77843#false} ~cond := #in~cond; {77843#false} is VALID [2022-04-08 10:10:28,397 INFO L272 TraceCheckUtils]: 30: Hoare triple {77843#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {77843#false} is VALID [2022-04-08 10:10:28,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {77986#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {77843#false} is VALID [2022-04-08 10:10:28,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {77990#(< 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; {77986#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:28,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {77994#(< 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; {77990#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:28,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {77998#(< 0 (mod (+ main_~z~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; {77994#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:28,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {78002#(< 0 (mod (+ 4294967292 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; {77998#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:28,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {78006#(< 0 (mod (+ 4294967291 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; {78002#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:28,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {78010#(< 0 (mod (+ 4294967290 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; {78006#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:28,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {78014#(< 0 (mod (+ main_~z~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; {78010#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:28,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {78018#(< 0 (mod (+ 4294967288 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; {78014#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:28,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {78022#(< 0 (mod (+ main_~z~0 4294967287) 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; {78018#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:28,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {78026#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} ~z~0 := ~y~0; {78022#(< 0 (mod (+ main_~z~0 4294967287) 4294967296))} is VALID [2022-04-08 10:10:28,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {78026#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78026#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:10:28,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {78033#(< 0 (mod (+ 4294967288 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; {78026#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:10:28,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {78037#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78033#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:28,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {78041#(< 0 (mod (+ 4294967290 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; {78037#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:28,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {78045#(< 0 (mod (+ 4294967291 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; {78041#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:28,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {78049#(< 0 (mod (+ 4294967292 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; {78045#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:28,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {78053#(< 0 (mod (+ main_~y~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; {78049#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:28,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {78057#(< 0 (mod (+ main_~y~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; {78053#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:28,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {78061#(< 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; {78057#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:28,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {78065#(< 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; {78061#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:28,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {78069#(< 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; {78065#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:28,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {78073#(< 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; {78069#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:28,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {78077#(< 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; {78073#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:28,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {77842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78077#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:28,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {77842#true} call #t~ret9 := main(); {77842#true} is VALID [2022-04-08 10:10:28,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77842#true} {77842#true} #50#return; {77842#true} is VALID [2022-04-08 10:10:28,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {77842#true} assume true; {77842#true} is VALID [2022-04-08 10:10:28,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {77842#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); {77842#true} is VALID [2022-04-08 10:10:28,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {77842#true} call ULTIMATE.init(); {77842#true} is VALID [2022-04-08 10:10:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:28,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995535613] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:28,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:28,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:10:28,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:28,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [20875077] [2022-04-08 10:10:28,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [20875077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:28,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:28,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:10:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264444126] [2022-04-08 10:10:28,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:28,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:28,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:28,437 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:28,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:10:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:10:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2088, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:10:28,438 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:31,821 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2022-04-08 10:10:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-08 10:10:31,821 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-04-08 10:10:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-04-08 10:10:31,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 62 transitions. [2022-04-08 10:10:31,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:31,856 INFO L225 Difference]: With dead ends: 83 [2022-04-08 10:10:31,856 INFO L226 Difference]: Without dead ends: 78 [2022-04-08 10:10:31,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1132, Invalid=5510, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:10:31,856 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:31,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 124 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:10:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-08 10:10:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2022-04-08 10:10:32,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:32,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,438 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,439 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:32,439 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-08 10:10:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-08 10:10:32,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:32,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:32,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 78 states. [2022-04-08 10:10:32,439 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 78 states. [2022-04-08 10:10:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:32,440 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-04-08 10:10:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2022-04-08 10:10:32,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:32,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:32,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:32,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:10:32,441 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:10:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:32,441 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:10:32,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:32,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:10:34,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:10:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:34,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:34,253 INFO L499 BasicCegarLoop]: trace histogram [13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:34,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2022-04-08 10:10:34,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-04-08 10:10:34,461 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:34,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1315502092, now seen corresponding path program 225 times [2022-04-08 10:10:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:34,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369270686] [2022-04-08 10:10:34,463 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:34,463 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1315502092, now seen corresponding path program 226 times [2022-04-08 10:10:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:34,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756259228] [2022-04-08 10:10:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:34,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {78624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {78596#true} is VALID [2022-04-08 10:10:34,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-08 10:10:34,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-08 10:10:34,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {78596#true} call ULTIMATE.init(); {78624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:34,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {78624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {78596#true} is VALID [2022-04-08 10:10:34,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-08 10:10:34,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-08 10:10:34,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {78596#true} call #t~ret9 := main(); {78596#true} is VALID [2022-04-08 10:10:34,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {78596#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78601#(= main_~y~0 0)} is VALID [2022-04-08 10:10:34,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {78601#(= 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; {78602#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:34,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {78602#(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; {78603#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:34,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {78603#(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; {78604#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:34,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {78604#(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; {78605#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:34,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {78605#(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; {78606#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:34,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {78606#(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; {78607#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:34,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {78607#(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; {78608#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:34,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {78608#(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; {78609#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:34,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {78609#(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; {78610#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:34,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {78610#(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; {78611#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:34,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {78611#(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; {78612#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:34,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {78612#(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; {78613#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:34,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {78613#(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; {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:34,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:34,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {78615#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:34,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {78615#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78616#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:34,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {78616#(and (<= main_~z~0 12) (<= 12 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; {78617#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:34,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {78617#(and (<= main_~z~0 11) (<= 11 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; {78618#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:34,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {78618#(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; {78619#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:34,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {78619#(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; {78620#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:34,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {78620#(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; {78621#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:34,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {78621#(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; {78622#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:34,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {78622#(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; {78623#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:34,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {78623#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {78597#false} is VALID [2022-04-08 10:10:34,924 INFO L272 TraceCheckUtils]: 30: Hoare triple {78597#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78597#false} is VALID [2022-04-08 10:10:34,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {78597#false} ~cond := #in~cond; {78597#false} is VALID [2022-04-08 10:10:34,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {78597#false} assume 0 == ~cond; {78597#false} is VALID [2022-04-08 10:10:34,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {78597#false} assume !false; {78597#false} is VALID [2022-04-08 10:10:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756259228] [2022-04-08 10:10:34,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756259228] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939402247] [2022-04-08 10:10:34,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:34,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:34,926 INFO L229 MonitoredProcess]: Starting monitored process 134 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:34,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-04-08 10:10:34,968 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:34,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:34,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:10:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:34,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:35,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {78596#true} call ULTIMATE.init(); {78596#true} is VALID [2022-04-08 10:10:35,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {78596#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); {78596#true} is VALID [2022-04-08 10:10:35,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-08 10:10:35,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-08 10:10:35,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {78596#true} call #t~ret9 := main(); {78596#true} is VALID [2022-04-08 10:10:35,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {78596#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78601#(= main_~y~0 0)} is VALID [2022-04-08 10:10:35,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {78601#(= 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; {78602#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:35,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {78602#(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; {78603#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:35,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {78603#(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; {78604#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:35,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {78604#(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; {78605#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:35,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {78605#(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; {78606#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:35,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {78606#(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; {78607#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:35,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {78607#(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; {78608#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:35,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {78608#(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; {78609#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:35,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {78609#(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; {78610#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:35,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {78610#(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; {78611#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:35,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {78611#(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; {78612#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:35,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {78612#(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; {78613#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:35,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {78613#(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; {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:35,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:35,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {78614#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {78615#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:35,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {78615#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78616#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:35,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {78616#(and (<= main_~z~0 12) (<= 12 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; {78617#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:35,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {78617#(and (<= main_~z~0 11) (<= 11 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; {78618#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:35,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {78618#(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; {78619#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:35,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {78619#(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; {78620#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:35,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {78620#(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; {78621#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:35,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {78621#(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; {78622#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:35,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {78622#(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; {78712#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:10:35,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {78712#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78597#false} is VALID [2022-04-08 10:10:35,379 INFO L272 TraceCheckUtils]: 30: Hoare triple {78597#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78597#false} is VALID [2022-04-08 10:10:35,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {78597#false} ~cond := #in~cond; {78597#false} is VALID [2022-04-08 10:10:35,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {78597#false} assume 0 == ~cond; {78597#false} is VALID [2022-04-08 10:10:35,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {78597#false} assume !false; {78597#false} is VALID [2022-04-08 10:10:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:35,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:36,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {78597#false} assume !false; {78597#false} is VALID [2022-04-08 10:10:36,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {78597#false} assume 0 == ~cond; {78597#false} is VALID [2022-04-08 10:10:36,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {78597#false} ~cond := #in~cond; {78597#false} is VALID [2022-04-08 10:10:36,314 INFO L272 TraceCheckUtils]: 30: Hoare triple {78597#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78597#false} is VALID [2022-04-08 10:10:36,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {78740#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78597#false} is VALID [2022-04-08 10:10:36,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {78744#(< 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; {78740#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:36,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {78748#(< 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; {78744#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:36,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {78752#(< 0 (mod (+ main_~z~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; {78748#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:36,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {78756#(< 0 (mod (+ 4294967292 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; {78752#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:36,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {78760#(< 0 (mod (+ 4294967291 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; {78756#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:36,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {78764#(< 0 (mod (+ 4294967290 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; {78760#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:36,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {78768#(< 0 (mod (+ main_~z~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; {78764#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:36,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {78772#(< 0 (mod (+ 4294967288 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; {78768#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:36,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {78776#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} ~z~0 := ~y~0; {78772#(< 0 (mod (+ 4294967288 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:36,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {78776#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78776#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:36,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {78783#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78776#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:36,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {78787#(< 0 (mod (+ 4294967290 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; {78783#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:36,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {78791#(< 0 (mod (+ 4294967291 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; {78787#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:36,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {78795#(< 0 (mod (+ 4294967292 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; {78791#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:36,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {78799#(< 0 (mod (+ main_~y~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; {78795#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:36,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {78803#(< 0 (mod (+ main_~y~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; {78799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:36,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {78807#(< 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; {78803#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:36,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {78811#(< 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; {78807#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:36,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {78815#(< 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; {78811#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:36,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {78819#(< 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; {78815#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:36,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {78823#(< 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; {78819#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:36,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {78827#(< 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; {78823#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:36,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {78831#(< 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; {78827#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:36,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {78596#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78831#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:36,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {78596#true} call #t~ret9 := main(); {78596#true} is VALID [2022-04-08 10:10:36,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78596#true} {78596#true} #50#return; {78596#true} is VALID [2022-04-08 10:10:36,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {78596#true} assume true; {78596#true} is VALID [2022-04-08 10:10:36,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {78596#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); {78596#true} is VALID [2022-04-08 10:10:36,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {78596#true} call ULTIMATE.init(); {78596#true} is VALID [2022-04-08 10:10:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939402247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:36,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:36,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:10:36,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:36,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369270686] [2022-04-08 10:10:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369270686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:36,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:36,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:10:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069243949] [2022-04-08 10:10:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:36,333 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:36,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:36,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:36,357 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:36,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:10:36,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:36,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:10:36,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2075, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:10:36,358 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:40,538 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2022-04-08 10:10:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 10:10:40,539 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2022-04-08 10:10:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2022-04-08 10:10:40,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 73 transitions. [2022-04-08 10:10:40,578 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:10:40,579 INFO L225 Difference]: With dead ends: 93 [2022-04-08 10:10:40,579 INFO L226 Difference]: Without dead ends: 88 [2022-04-08 10:10:40,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1335, Invalid=6321, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:10:40,579 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:40,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:10:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-08 10:10:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2022-04-08 10:10:41,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:41,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:41,171 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:41,171 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:41,172 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-08 10:10:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-08 10:10:41,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:41,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:41,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 88 states. [2022-04-08 10:10:41,172 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 88 states. [2022-04-08 10:10:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:41,173 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-04-08 10:10:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-04-08 10:10:41,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:41,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:41,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:41,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:10:41,173 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:10:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:41,173 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:10:41,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:41,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:10:43,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:10:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:43,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:43,131 INFO L499 BasicCegarLoop]: trace histogram [14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:43,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2022-04-08 10:10:43,345 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-04-08 10:10:43,346 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1414649931, now seen corresponding path program 227 times [2022-04-08 10:10:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:43,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [27855852] [2022-04-08 10:10:43,348 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:43,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1414649931, now seen corresponding path program 228 times [2022-04-08 10:10:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:43,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566677919] [2022-04-08 10:10:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:43,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:43,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:43,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {79430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {79402#true} is VALID [2022-04-08 10:10:43,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-08 10:10:43,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-08 10:10:43,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {79402#true} call ULTIMATE.init(); {79430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:43,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {79430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {79402#true} is VALID [2022-04-08 10:10:43,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-08 10:10:43,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-08 10:10:43,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {79402#true} call #t~ret9 := main(); {79402#true} is VALID [2022-04-08 10:10:43,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {79402#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79407#(= main_~y~0 0)} is VALID [2022-04-08 10:10:43,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {79407#(= 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; {79408#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:43,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {79408#(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; {79409#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:43,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {79409#(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; {79410#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:43,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {79410#(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; {79411#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:43,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {79411#(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; {79412#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:43,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {79412#(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; {79413#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:43,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {79413#(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; {79414#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:43,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {79414#(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; {79415#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:43,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {79415#(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; {79416#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:43,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {79416#(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; {79417#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:43,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {79417#(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; {79418#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:43,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {79418#(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; {79419#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:43,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {79419#(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; {79420#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:43,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {79420#(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; {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:43,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:43,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {79422#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:43,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {79422#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79423#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:43,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {79423#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79424#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:43,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {79424#(and (<= main_~z~0 12) (<= 12 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; {79425#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:43,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {79425#(and (<= main_~z~0 11) (<= 11 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; {79426#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:43,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {79426#(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; {79427#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:43,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {79427#(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; {79428#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:43,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {79428#(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; {79429#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:43,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {79429#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {79403#false} is VALID [2022-04-08 10:10:43,772 INFO L272 TraceCheckUtils]: 30: Hoare triple {79403#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79403#false} is VALID [2022-04-08 10:10:43,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {79403#false} ~cond := #in~cond; {79403#false} is VALID [2022-04-08 10:10:43,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {79403#false} assume 0 == ~cond; {79403#false} is VALID [2022-04-08 10:10:43,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {79403#false} assume !false; {79403#false} is VALID [2022-04-08 10:10:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:43,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566677919] [2022-04-08 10:10:43,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566677919] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:43,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667146078] [2022-04-08 10:10:43,772 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:43,773 INFO L229 MonitoredProcess]: Starting monitored process 135 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:43,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-04-08 10:10:43,980 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 10:10:43,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:43,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:10:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:43,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:44,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {79402#true} call ULTIMATE.init(); {79402#true} is VALID [2022-04-08 10:10:44,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {79402#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); {79402#true} is VALID [2022-04-08 10:10:44,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-08 10:10:44,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-08 10:10:44,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {79402#true} call #t~ret9 := main(); {79402#true} is VALID [2022-04-08 10:10:44,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {79402#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79407#(= main_~y~0 0)} is VALID [2022-04-08 10:10:44,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {79407#(= 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; {79408#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:44,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {79408#(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; {79409#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:44,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {79409#(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; {79410#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:44,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {79410#(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; {79411#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:44,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {79411#(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; {79412#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:44,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {79412#(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; {79413#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:44,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {79413#(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; {79414#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:44,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {79414#(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; {79415#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:44,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {79415#(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; {79416#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:44,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {79416#(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; {79417#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:44,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {79417#(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; {79418#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:44,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {79418#(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; {79419#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:44,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {79419#(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; {79420#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:44,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {79420#(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; {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:44,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:44,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {79421#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {79422#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:44,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {79422#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79423#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:44,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {79423#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79424#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:44,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {79424#(and (<= main_~z~0 12) (<= 12 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; {79425#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:44,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {79425#(and (<= main_~z~0 11) (<= 11 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; {79426#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:44,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {79426#(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; {79427#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:44,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {79427#(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; {79428#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:44,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {79428#(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; {79518#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:44,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {79518#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {79403#false} is VALID [2022-04-08 10:10:44,307 INFO L272 TraceCheckUtils]: 30: Hoare triple {79403#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79403#false} is VALID [2022-04-08 10:10:44,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {79403#false} ~cond := #in~cond; {79403#false} is VALID [2022-04-08 10:10:44,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {79403#false} assume 0 == ~cond; {79403#false} is VALID [2022-04-08 10:10:44,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {79403#false} assume !false; {79403#false} is VALID [2022-04-08 10:10:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:44,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:45,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {79403#false} assume !false; {79403#false} is VALID [2022-04-08 10:10:45,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {79403#false} assume 0 == ~cond; {79403#false} is VALID [2022-04-08 10:10:45,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {79403#false} ~cond := #in~cond; {79403#false} is VALID [2022-04-08 10:10:45,210 INFO L272 TraceCheckUtils]: 30: Hoare triple {79403#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79403#false} is VALID [2022-04-08 10:10:45,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {79546#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {79403#false} is VALID [2022-04-08 10:10:45,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {79550#(< 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; {79546#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:45,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {79554#(< 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; {79550#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:45,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {79558#(< 0 (mod (+ main_~z~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; {79554#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:45,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {79562#(< 0 (mod (+ 4294967292 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; {79558#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:45,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {79566#(< 0 (mod (+ 4294967291 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; {79562#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:45,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {79570#(< 0 (mod (+ 4294967290 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; {79566#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:45,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {79574#(< 0 (mod (+ main_~z~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; {79570#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:45,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {79578#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {79574#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:45,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {79578#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {79578#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:45,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {79585#(< 0 (mod (+ 4294967290 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; {79578#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:10:45,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {79589#(< 0 (mod (+ 4294967291 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; {79585#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:45,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {79593#(< 0 (mod (+ 4294967292 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; {79589#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:45,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {79597#(< 0 (mod (+ main_~y~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; {79593#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:45,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {79601#(< 0 (mod (+ main_~y~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; {79597#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:45,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {79605#(< 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; {79601#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:45,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {79609#(< 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; {79605#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:45,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {79613#(< 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; {79609#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:45,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {79617#(< 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; {79613#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:45,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {79621#(< 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; {79617#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:45,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {79625#(< 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; {79621#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:45,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {79629#(< 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; {79625#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:45,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {79633#(< 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; {79629#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:45,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {79637#(< 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; {79633#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:45,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {79402#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79637#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:45,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {79402#true} call #t~ret9 := main(); {79402#true} is VALID [2022-04-08 10:10:45,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79402#true} {79402#true} #50#return; {79402#true} is VALID [2022-04-08 10:10:45,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {79402#true} assume true; {79402#true} is VALID [2022-04-08 10:10:45,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {79402#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); {79402#true} is VALID [2022-04-08 10:10:45,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {79402#true} call ULTIMATE.init(); {79402#true} is VALID [2022-04-08 10:10:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:45,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667146078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:45,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:45,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:10:45,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:45,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [27855852] [2022-04-08 10:10:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [27855852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:45,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:45,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:10:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136050414] [2022-04-08 10:10:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:45,225 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:45,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:45,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:45,242 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:45,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:10:45,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:45,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:10:45,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:10:45,243 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:49,929 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2022-04-08 10:10:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 10:10:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 81 transitions. [2022-04-08 10:10:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 81 transitions. [2022-04-08 10:10:49,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 81 transitions. [2022-04-08 10:10:49,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:49,978 INFO L225 Difference]: With dead ends: 102 [2022-04-08 10:10:49,978 INFO L226 Difference]: Without dead ends: 97 [2022-04-08 10:10:49,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1463, Invalid=6727, Unknown=0, NotChecked=0, Total=8190 [2022-04-08 10:10:49,978 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:49,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:10:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-08 10:10:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-04-08 10:10:50,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:50,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:50,587 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:50,587 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:50,588 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-04-08 10:10:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2022-04-08 10:10:50,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:50,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:50,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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:10:50,588 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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:10:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:50,589 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-04-08 10:10:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2022-04-08 10:10:50,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:50,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:50,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:50,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:10:50,589 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:10:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:50,590 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:10:50,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:50,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:10:52,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:10:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:10:52,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:52,528 INFO L499 BasicCegarLoop]: trace histogram [15, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:52,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:52,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-04-08 10:10:52,733 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1002206252, now seen corresponding path program 229 times [2022-04-08 10:10:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:52,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369579353] [2022-04-08 10:10:52,735 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:52,735 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1002206252, now seen corresponding path program 230 times [2022-04-08 10:10:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:52,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732945989] [2022-04-08 10:10:52,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:53,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:53,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {80278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {80250#true} is VALID [2022-04-08 10:10:53,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-08 10:10:53,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-08 10:10:53,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {80250#true} call ULTIMATE.init(); {80278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:53,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {80278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {80250#true} is VALID [2022-04-08 10:10:53,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-08 10:10:53,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-08 10:10:53,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {80250#true} call #t~ret9 := main(); {80250#true} is VALID [2022-04-08 10:10:53,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {80250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80255#(= main_~y~0 0)} is VALID [2022-04-08 10:10:53,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {80255#(= 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; {80256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:53,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {80256#(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; {80257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:53,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {80257#(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; {80258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:53,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {80258#(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; {80259#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:53,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {80259#(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; {80260#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:53,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {80260#(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; {80261#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:53,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {80261#(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; {80262#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:53,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {80262#(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; {80263#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:53,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {80263#(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; {80264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:53,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {80264#(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; {80265#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:53,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {80265#(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; {80266#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:53,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {80266#(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; {80267#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:53,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {80267#(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; {80268#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:53,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {80268#(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; {80269#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:53,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {80269#(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; {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:53,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:53,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {80271#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:10:53,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {80271#(and (<= main_~z~0 15) (<= 15 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; {80272#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:53,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {80272#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80273#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:53,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {80273#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80274#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:53,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {80274#(and (<= main_~z~0 12) (<= 12 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; {80275#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:53,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {80275#(and (<= main_~z~0 11) (<= 11 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; {80276#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:53,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {80276#(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; {80277#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:53,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {80277#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80251#false} is VALID [2022-04-08 10:10:53,170 INFO L272 TraceCheckUtils]: 30: Hoare triple {80251#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80251#false} is VALID [2022-04-08 10:10:53,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {80251#false} ~cond := #in~cond; {80251#false} is VALID [2022-04-08 10:10:53,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {80251#false} assume 0 == ~cond; {80251#false} is VALID [2022-04-08 10:10:53,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {80251#false} assume !false; {80251#false} is VALID [2022-04-08 10:10:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:53,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:53,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732945989] [2022-04-08 10:10:53,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732945989] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:53,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802701738] [2022-04-08 10:10:53,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:53,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:53,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:53,171 INFO L229 MonitoredProcess]: Starting monitored process 136 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:53,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-04-08 10:10:53,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:53,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:53,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:10:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:53,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:53,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {80250#true} call ULTIMATE.init(); {80250#true} is VALID [2022-04-08 10:10:53,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {80250#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); {80250#true} is VALID [2022-04-08 10:10:53,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-08 10:10:53,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-08 10:10:53,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {80250#true} call #t~ret9 := main(); {80250#true} is VALID [2022-04-08 10:10:53,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {80250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80255#(= main_~y~0 0)} is VALID [2022-04-08 10:10:53,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {80255#(= 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; {80256#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:53,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {80256#(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; {80257#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:53,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {80257#(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; {80258#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:53,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {80258#(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; {80259#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:53,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {80259#(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; {80260#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:53,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {80260#(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; {80261#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:53,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {80261#(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; {80262#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:53,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {80262#(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; {80263#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:53,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {80263#(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; {80264#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:53,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {80264#(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; {80265#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:53,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {80265#(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; {80266#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:53,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {80266#(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; {80267#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:10:53,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {80267#(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; {80268#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:10:53,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {80268#(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; {80269#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:10:53,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {80269#(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; {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:53,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:10:53,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {80270#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {80271#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:10:53,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {80271#(and (<= main_~z~0 15) (<= 15 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; {80272#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:10:53,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {80272#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80273#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:10:53,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {80273#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80274#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:10:53,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {80274#(and (<= main_~z~0 12) (<= 12 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; {80275#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:53,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {80275#(and (<= main_~z~0 11) (<= 11 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; {80276#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:53,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {80276#(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; {80366#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:53,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {80366#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {80251#false} is VALID [2022-04-08 10:10:53,465 INFO L272 TraceCheckUtils]: 30: Hoare triple {80251#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80251#false} is VALID [2022-04-08 10:10:53,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {80251#false} ~cond := #in~cond; {80251#false} is VALID [2022-04-08 10:10:53,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {80251#false} assume 0 == ~cond; {80251#false} is VALID [2022-04-08 10:10:53,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {80251#false} assume !false; {80251#false} is VALID [2022-04-08 10:10:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:53,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:54,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {80251#false} assume !false; {80251#false} is VALID [2022-04-08 10:10:54,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {80251#false} assume 0 == ~cond; {80251#false} is VALID [2022-04-08 10:10:54,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {80251#false} ~cond := #in~cond; {80251#false} is VALID [2022-04-08 10:10:54,301 INFO L272 TraceCheckUtils]: 30: Hoare triple {80251#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80251#false} is VALID [2022-04-08 10:10:54,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {80394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80251#false} is VALID [2022-04-08 10:10:54,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {80398#(< 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; {80394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:54,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {80402#(< 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; {80398#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:54,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {80406#(< 0 (mod (+ main_~z~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; {80402#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:54,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {80410#(< 0 (mod (+ 4294967292 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; {80406#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:54,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {80414#(< 0 (mod (+ 4294967291 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; {80410#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:54,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {80418#(< 0 (mod (+ 4294967290 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; {80414#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:54,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {80422#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {80418#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-08 10:10:54,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {80422#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {80422#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:54,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {80429#(< 0 (mod (+ 4294967291 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; {80422#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:54,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {80433#(< 0 (mod (+ 4294967292 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; {80429#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:54,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {80437#(< 0 (mod (+ main_~y~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; {80433#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:54,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {80441#(< 0 (mod (+ main_~y~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; {80437#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:54,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {80445#(< 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; {80441#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:54,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {80449#(< 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; {80445#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:54,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {80453#(< 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; {80449#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:54,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {80457#(< 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; {80453#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:54,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {80461#(< 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; {80457#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:54,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {80465#(< 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; {80461#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:54,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {80469#(< 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; {80465#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:54,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {80473#(< 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; {80469#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:54,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {80477#(< 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; {80473#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:54,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {80481#(< 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; {80477#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:54,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {80485#(< 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; {80481#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:54,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {80250#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80485#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:10:54,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {80250#true} call #t~ret9 := main(); {80250#true} is VALID [2022-04-08 10:10:54,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80250#true} {80250#true} #50#return; {80250#true} is VALID [2022-04-08 10:10:54,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {80250#true} assume true; {80250#true} is VALID [2022-04-08 10:10:54,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {80250#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); {80250#true} is VALID [2022-04-08 10:10:54,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {80250#true} call ULTIMATE.init(); {80250#true} is VALID [2022-04-08 10:10:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:10:54,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802701738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:54,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:54,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:10:54,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:54,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369579353] [2022-04-08 10:10:54,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369579353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:54,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:54,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:10:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211738834] [2022-04-08 10:10:54,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:54,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:54,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:54,343 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:54,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:10:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:10:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:10:54,344 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:00,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:00,175 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2022-04-08 10:11:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-08 10:11:00,175 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 86 transitions. [2022-04-08 10:11:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 86 transitions. [2022-04-08 10:11:00,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 86 transitions. [2022-04-08 10:11:00,225 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:11:00,225 INFO L225 Difference]: With dead ends: 110 [2022-04-08 10:11:00,225 INFO L226 Difference]: Without dead ends: 105 [2022-04-08 10:11:00,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1487, Invalid=6703, Unknown=0, NotChecked=0, Total=8190 [2022-04-08 10:11:00,226 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:00,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 133 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:11:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-08 10:11:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 56. [2022-04-08 10:11:00,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:00,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:00,970 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:00,970 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:00,971 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2022-04-08 10:11:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2022-04-08 10:11:00,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:00,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:00,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 105 states. [2022-04-08 10:11:00,972 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 105 states. [2022-04-08 10:11:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:00,972 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2022-04-08 10:11:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2022-04-08 10:11:00,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:00,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:00,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:00,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:11:00,973 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:11:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:00,973 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:11:00,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:00,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:11:02,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:11:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:11:02,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:02,943 INFO L499 BasicCegarLoop]: trace histogram [16, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:02,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:03,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-04-08 10:11:03,147 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:03,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1366403029, now seen corresponding path program 231 times [2022-04-08 10:11:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:03,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378579644] [2022-04-08 10:11:03,150 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:03,150 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1366403029, now seen corresponding path program 232 times [2022-04-08 10:11:03,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:03,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757190381] [2022-04-08 10:11:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:03,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {81158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {81130#true} is VALID [2022-04-08 10:11:03,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-08 10:11:03,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-08 10:11:03,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {81130#true} call ULTIMATE.init(); {81158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:03,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {81158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {81130#true} is VALID [2022-04-08 10:11:03,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-08 10:11:03,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-08 10:11:03,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {81130#true} call #t~ret9 := main(); {81130#true} is VALID [2022-04-08 10:11:03,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {81130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81135#(= main_~y~0 0)} is VALID [2022-04-08 10:11:03,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {81135#(= 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; {81136#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:03,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {81136#(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; {81137#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:03,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {81137#(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; {81138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:03,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {81138#(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; {81139#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:03,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {81139#(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; {81140#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:03,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {81140#(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; {81141#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:03,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {81141#(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; {81142#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:03,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {81142#(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; {81143#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:03,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {81143#(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; {81144#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:03,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {81144#(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; {81145#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:03,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {81145#(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; {81146#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:03,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {81146#(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; {81147#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:03,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {81147#(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; {81148#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:03,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {81148#(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; {81149#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:03,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {81149#(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; {81150#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:03,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {81150#(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; {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:03,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:03,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {81152#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:03,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {81152#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81153#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:03,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {81153#(and (<= main_~z~0 15) (<= 15 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; {81154#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:03,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {81154#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81155#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:03,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {81155#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81156#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:03,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {81156#(and (<= main_~z~0 12) (<= 12 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; {81157#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:03,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {81157#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81131#false} is VALID [2022-04-08 10:11:03,653 INFO L272 TraceCheckUtils]: 30: Hoare triple {81131#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81131#false} is VALID [2022-04-08 10:11:03,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {81131#false} ~cond := #in~cond; {81131#false} is VALID [2022-04-08 10:11:03,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {81131#false} assume 0 == ~cond; {81131#false} is VALID [2022-04-08 10:11:03,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {81131#false} assume !false; {81131#false} is VALID [2022-04-08 10:11:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:03,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:03,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757190381] [2022-04-08 10:11:03,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757190381] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:03,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39790999] [2022-04-08 10:11:03,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:03,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:03,654 INFO L229 MonitoredProcess]: Starting monitored process 137 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:03,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-04-08 10:11:03,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:03,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:03,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:11:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:03,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:04,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {81130#true} call ULTIMATE.init(); {81130#true} is VALID [2022-04-08 10:11:04,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {81130#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); {81130#true} is VALID [2022-04-08 10:11:04,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-08 10:11:04,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-08 10:11:04,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {81130#true} call #t~ret9 := main(); {81130#true} is VALID [2022-04-08 10:11:04,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {81130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81135#(= main_~y~0 0)} is VALID [2022-04-08 10:11:04,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {81135#(= 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; {81136#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:04,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {81136#(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; {81137#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:04,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {81137#(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; {81138#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:04,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {81138#(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; {81139#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:04,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {81139#(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; {81140#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:04,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {81140#(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; {81141#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:04,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {81141#(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; {81142#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:04,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {81142#(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; {81143#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:04,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {81143#(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; {81144#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:04,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {81144#(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; {81145#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:04,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {81145#(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; {81146#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:04,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {81146#(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; {81147#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:04,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {81147#(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; {81148#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:04,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {81148#(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; {81149#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:04,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {81149#(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; {81150#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:04,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {81150#(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; {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:04,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:04,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {81151#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {81152#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:04,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {81152#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81153#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:04,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {81153#(and (<= main_~z~0 15) (<= 15 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; {81154#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:04,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {81154#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81155#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:04,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {81155#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81156#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:11:04,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {81156#(and (<= main_~z~0 12) (<= 12 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; {81246#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:11:04,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {81246#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {81131#false} is VALID [2022-04-08 10:11:04,078 INFO L272 TraceCheckUtils]: 30: Hoare triple {81131#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81131#false} is VALID [2022-04-08 10:11:04,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {81131#false} ~cond := #in~cond; {81131#false} is VALID [2022-04-08 10:11:04,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {81131#false} assume 0 == ~cond; {81131#false} is VALID [2022-04-08 10:11:04,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {81131#false} assume !false; {81131#false} is VALID [2022-04-08 10:11:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:04,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:05,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {81131#false} assume !false; {81131#false} is VALID [2022-04-08 10:11:05,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {81131#false} assume 0 == ~cond; {81131#false} is VALID [2022-04-08 10:11:05,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {81131#false} ~cond := #in~cond; {81131#false} is VALID [2022-04-08 10:11:05,024 INFO L272 TraceCheckUtils]: 30: Hoare triple {81131#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {81131#false} is VALID [2022-04-08 10:11:05,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {81274#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {81131#false} is VALID [2022-04-08 10:11:05,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {81278#(< 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; {81274#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:05,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {81282#(< 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; {81278#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:05,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {81286#(< 0 (mod (+ main_~z~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; {81282#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:05,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {81290#(< 0 (mod (+ 4294967292 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; {81286#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:05,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {81294#(< 0 (mod (+ 4294967291 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; {81290#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:05,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {81298#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {81294#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:05,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {81298#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81298#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {81305#(< 0 (mod (+ 4294967292 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; {81298#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {81309#(< 0 (mod (+ main_~y~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; {81305#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {81313#(< 0 (mod (+ main_~y~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; {81309#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:05,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {81317#(< 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; {81313#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:05,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {81321#(< 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; {81317#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:05,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {81325#(< 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; {81321#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:05,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {81329#(< 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; {81325#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:05,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {81333#(< 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; {81329#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:05,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {81337#(< 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; {81333#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:05,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {81341#(< 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; {81337#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:05,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {81345#(< 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; {81341#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {81349#(< 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; {81345#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:05,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {81353#(< 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; {81349#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:05,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {81357#(< 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; {81353#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:05,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {81361#(< 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; {81357#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:05,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {81365#(< 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; {81361#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:05,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {81130#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81365#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:05,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {81130#true} call #t~ret9 := main(); {81130#true} is VALID [2022-04-08 10:11:05,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81130#true} {81130#true} #50#return; {81130#true} is VALID [2022-04-08 10:11:05,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {81130#true} assume true; {81130#true} is VALID [2022-04-08 10:11:05,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {81130#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); {81130#true} is VALID [2022-04-08 10:11:05,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {81130#true} call ULTIMATE.init(); {81130#true} is VALID [2022-04-08 10:11:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:05,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39790999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:05,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:05,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:11:05,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:05,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378579644] [2022-04-08 10:11:05,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378579644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:05,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:05,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:11:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784068833] [2022-04-08 10:11:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:05,044 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:05,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:05,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:05,072 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:11:05,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:11:05,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:11:05,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2022, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:11:05,073 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:11,752 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-04-08 10:11:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-08 10:11:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-08 10:11:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2022-04-08 10:11:11,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 88 transitions. [2022-04-08 10:11:11,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:11,826 INFO L225 Difference]: With dead ends: 117 [2022-04-08 10:11:11,826 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 10:11:11,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1418, Invalid=6238, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:11:11,826 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 47 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:11,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 136 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:11:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 10:11:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 56. [2022-04-08 10:11:12,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:12,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:12,555 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:12,555 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:12,556 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-04-08 10:11:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2022-04-08 10:11:12,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:12,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:12,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 112 states. [2022-04-08 10:11:12,556 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 112 states. [2022-04-08 10:11:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:12,557 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-04-08 10:11:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2022-04-08 10:11:12,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:12,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:12,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:12,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:11:12,558 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:11:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:12,558 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:11:12,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:12,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:11:14,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:11:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:11:14,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:14,512 INFO L499 BasicCegarLoop]: trace histogram [17, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:14,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:14,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:14,727 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1442809780, now seen corresponding path program 233 times [2022-04-08 10:11:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:14,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886307127] [2022-04-08 10:11:14,730 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:14,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1442809780, now seen corresponding path program 234 times [2022-04-08 10:11:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:14,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126572976] [2022-04-08 10:11:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:14,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:15,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {82060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {82032#true} is VALID [2022-04-08 10:11:15,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-08 10:11:15,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-08 10:11:15,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {82032#true} call ULTIMATE.init(); {82060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:15,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {82060#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {82032#true} is VALID [2022-04-08 10:11:15,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-08 10:11:15,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-08 10:11:15,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {82032#true} call #t~ret9 := main(); {82032#true} is VALID [2022-04-08 10:11:15,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {82032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82037#(= main_~y~0 0)} is VALID [2022-04-08 10:11:15,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {82037#(= 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; {82038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:15,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {82038#(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; {82039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:15,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {82039#(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; {82040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:15,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {82040#(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; {82041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:15,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {82041#(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; {82042#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:15,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {82042#(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; {82043#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:15,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {82043#(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; {82044#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:15,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {82044#(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; {82045#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:15,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {82045#(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; {82046#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:15,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {82046#(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; {82047#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:15,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {82047#(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; {82048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:15,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {82048#(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; {82049#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:15,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {82049#(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; {82050#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:15,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {82050#(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; {82051#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:15,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {82051#(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; {82052#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:15,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {82052#(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; {82053#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:15,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {82053#(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; {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:15,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:15,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {82055#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:11:15,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {82055#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:15,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {82056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82057#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:15,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {82057#(and (<= main_~z~0 15) (<= 15 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; {82058#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:15,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {82058#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82059#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:15,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {82059#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {82033#false} is VALID [2022-04-08 10:11:15,222 INFO L272 TraceCheckUtils]: 30: Hoare triple {82033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82033#false} is VALID [2022-04-08 10:11:15,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {82033#false} ~cond := #in~cond; {82033#false} is VALID [2022-04-08 10:11:15,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {82033#false} assume 0 == ~cond; {82033#false} is VALID [2022-04-08 10:11:15,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {82033#false} assume !false; {82033#false} is VALID [2022-04-08 10:11:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:15,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126572976] [2022-04-08 10:11:15,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126572976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:15,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753723670] [2022-04-08 10:11:15,223 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:15,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:15,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:15,224 INFO L229 MonitoredProcess]: Starting monitored process 138 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:15,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2022-04-08 10:11:15,542 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:11:15,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:15,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:11:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:15,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:15,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {82032#true} call ULTIMATE.init(); {82032#true} is VALID [2022-04-08 10:11:15,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {82032#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); {82032#true} is VALID [2022-04-08 10:11:15,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-08 10:11:15,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-08 10:11:15,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {82032#true} call #t~ret9 := main(); {82032#true} is VALID [2022-04-08 10:11:15,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {82032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82037#(= main_~y~0 0)} is VALID [2022-04-08 10:11:15,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {82037#(= 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; {82038#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:15,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {82038#(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; {82039#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:15,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {82039#(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; {82040#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:15,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {82040#(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; {82041#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:15,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {82041#(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; {82042#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:15,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {82042#(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; {82043#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:15,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {82043#(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; {82044#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:15,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {82044#(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; {82045#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:15,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {82045#(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; {82046#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:15,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {82046#(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; {82047#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:15,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {82047#(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; {82048#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:15,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {82048#(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; {82049#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:15,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {82049#(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; {82050#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:15,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {82050#(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; {82051#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:15,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {82051#(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; {82052#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:15,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {82052#(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; {82053#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:15,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {82053#(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; {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:15,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:15,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {82054#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {82055#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:11:15,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {82055#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:15,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {82056#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82057#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:15,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {82057#(and (<= main_~z~0 15) (<= 15 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; {82058#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:11:15,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {82058#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82148#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:11:15,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {82148#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {82033#false} is VALID [2022-04-08 10:11:15,776 INFO L272 TraceCheckUtils]: 30: Hoare triple {82033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82033#false} is VALID [2022-04-08 10:11:15,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {82033#false} ~cond := #in~cond; {82033#false} is VALID [2022-04-08 10:11:15,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {82033#false} assume 0 == ~cond; {82033#false} is VALID [2022-04-08 10:11:15,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {82033#false} assume !false; {82033#false} is VALID [2022-04-08 10:11:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:15,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:16,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {82033#false} assume !false; {82033#false} is VALID [2022-04-08 10:11:16,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {82033#false} assume 0 == ~cond; {82033#false} is VALID [2022-04-08 10:11:16,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {82033#false} ~cond := #in~cond; {82033#false} is VALID [2022-04-08 10:11:16,493 INFO L272 TraceCheckUtils]: 30: Hoare triple {82033#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82033#false} is VALID [2022-04-08 10:11:16,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {82176#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {82033#false} is VALID [2022-04-08 10:11:16,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {82180#(< 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; {82176#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:16,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {82184#(< 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; {82180#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:16,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {82188#(< 0 (mod (+ main_~z~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; {82184#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:16,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {82192#(< 0 (mod (+ 4294967292 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; {82188#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:16,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {82196#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {82192#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:11:16,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {82196#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {82196#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:16,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {82203#(< 0 (mod (+ main_~y~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; {82196#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:16,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {82207#(< 0 (mod (+ main_~y~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; {82203#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:16,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {82211#(< 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; {82207#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:16,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {82215#(< 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; {82211#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:16,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {82219#(< 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; {82215#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:16,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {82223#(< 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; {82219#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:16,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {82227#(< 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; {82223#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:16,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {82231#(< 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; {82227#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:16,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {82235#(< 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; {82231#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:16,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {82239#(< 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; {82235#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:16,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {82243#(< 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; {82239#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:16,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {82247#(< 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; {82243#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:16,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {82251#(< 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; {82247#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:16,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {82255#(< 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; {82251#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:16,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {82259#(< 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; {82255#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:16,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {82263#(< 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; {82259#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:16,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {82267#(< 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; {82263#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:16,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {82032#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82267#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:16,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {82032#true} call #t~ret9 := main(); {82032#true} is VALID [2022-04-08 10:11:16,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82032#true} {82032#true} #50#return; {82032#true} is VALID [2022-04-08 10:11:16,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {82032#true} assume true; {82032#true} is VALID [2022-04-08 10:11:16,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {82032#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); {82032#true} is VALID [2022-04-08 10:11:16,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {82032#true} call ULTIMATE.init(); {82032#true} is VALID [2022-04-08 10:11:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:16,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753723670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:16,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:16,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:11:16,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:16,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886307127] [2022-04-08 10:11:16,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886307127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:16,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:16,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:11:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251979011] [2022-04-08 10:11:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:16,510 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:16,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:16,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:16,526 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:11:16,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:11:16,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:11:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1999, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:11:16,528 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:22,263 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2022-04-08 10:11:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:11:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2022-04-08 10:11:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 88 transitions. [2022-04-08 10:11:22,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 88 transitions. [2022-04-08 10:11:22,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:22,319 INFO L225 Difference]: With dead ends: 123 [2022-04-08 10:11:22,319 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 10:11:22,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1297, Invalid=5509, Unknown=0, NotChecked=0, Total=6806 [2022-04-08 10:11:22,320 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 55 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:22,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 136 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:11:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 10:11:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 56. [2022-04-08 10:11:22,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:22,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:22,941 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:22,941 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:22,942 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2022-04-08 10:11:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2022-04-08 10:11:22,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:22,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:22,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 118 states. [2022-04-08 10:11:22,942 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 118 states. [2022-04-08 10:11:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:22,943 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2022-04-08 10:11:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2022-04-08 10:11:22,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:22,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:22,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:22,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:11:22,944 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:11:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:22,944 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:11:22,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:22,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:11:25,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:11:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:11:25,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:25,036 INFO L499 BasicCegarLoop]: trace histogram [18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:25,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:25,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2022-04-08 10:11:25,243 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:25,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:25,243 INFO L85 PathProgramCache]: Analyzing trace with hash -475443189, now seen corresponding path program 235 times [2022-04-08 10:11:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:25,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691602300] [2022-04-08 10:11:25,246 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:25,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash -475443189, now seen corresponding path program 236 times [2022-04-08 10:11:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:25,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822799100] [2022-04-08 10:11:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:25,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {82976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {82948#true} is VALID [2022-04-08 10:11:25,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-08 10:11:25,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-08 10:11:25,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {82948#true} call ULTIMATE.init(); {82976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:25,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {82976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {82948#true} is VALID [2022-04-08 10:11:25,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-08 10:11:25,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-08 10:11:25,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {82948#true} call #t~ret9 := main(); {82948#true} is VALID [2022-04-08 10:11:25,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {82948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82953#(= main_~y~0 0)} is VALID [2022-04-08 10:11:25,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {82953#(= 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; {82954#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:25,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {82954#(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; {82955#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:25,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {82955#(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; {82956#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:25,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {82956#(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; {82957#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:25,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {82957#(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; {82958#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:25,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {82958#(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; {82959#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:25,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {82959#(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; {82960#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:25,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {82960#(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; {82961#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:25,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {82961#(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; {82962#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:25,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {82962#(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; {82963#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:25,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {82963#(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; {82964#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:25,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {82964#(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; {82965#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:25,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {82965#(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; {82966#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:25,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {82966#(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; {82967#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:25,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {82967#(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; {82968#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:25,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {82968#(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; {82969#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:25,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {82969#(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; {82970#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:25,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {82970#(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; {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:25,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:25,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {82972#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:11:25,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {82972#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82973#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:11:25,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {82973#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82974#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:25,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {82974#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82975#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:25,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {82975#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {82949#false} is VALID [2022-04-08 10:11:25,688 INFO L272 TraceCheckUtils]: 30: Hoare triple {82949#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82949#false} is VALID [2022-04-08 10:11:25,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {82949#false} ~cond := #in~cond; {82949#false} is VALID [2022-04-08 10:11:25,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {82949#false} assume 0 == ~cond; {82949#false} is VALID [2022-04-08 10:11:25,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {82949#false} assume !false; {82949#false} is VALID [2022-04-08 10:11:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:25,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:25,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822799100] [2022-04-08 10:11:25,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822799100] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:25,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216852596] [2022-04-08 10:11:25,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:25,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:25,690 INFO L229 MonitoredProcess]: Starting monitored process 139 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:25,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-04-08 10:11:25,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:25,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:25,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:11:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:25,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:26,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {82948#true} call ULTIMATE.init(); {82948#true} is VALID [2022-04-08 10:11:26,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {82948#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); {82948#true} is VALID [2022-04-08 10:11:26,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-08 10:11:26,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-08 10:11:26,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {82948#true} call #t~ret9 := main(); {82948#true} is VALID [2022-04-08 10:11:26,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {82948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82953#(= main_~y~0 0)} is VALID [2022-04-08 10:11:26,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {82953#(= 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; {82954#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:26,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {82954#(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; {82955#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:26,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {82955#(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; {82956#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:26,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {82956#(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; {82957#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:26,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {82957#(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; {82958#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:26,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {82958#(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; {82959#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:26,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {82959#(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; {82960#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:26,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {82960#(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; {82961#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:26,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {82961#(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; {82962#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:26,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {82962#(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; {82963#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:26,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {82963#(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; {82964#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:26,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {82964#(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; {82965#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:26,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {82965#(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; {82966#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:26,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {82966#(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; {82967#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:26,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {82967#(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; {82968#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:26,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {82968#(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; {82969#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:26,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {82969#(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; {82970#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:26,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {82970#(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; {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:26,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:26,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {82971#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {82972#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:11:26,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {82972#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82973#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:11:26,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {82973#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {82974#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:11:26,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {82974#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83064#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:11:26,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {83064#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {82949#false} is VALID [2022-04-08 10:11:26,117 INFO L272 TraceCheckUtils]: 30: Hoare triple {82949#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82949#false} is VALID [2022-04-08 10:11:26,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {82949#false} ~cond := #in~cond; {82949#false} is VALID [2022-04-08 10:11:26,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {82949#false} assume 0 == ~cond; {82949#false} is VALID [2022-04-08 10:11:26,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {82949#false} assume !false; {82949#false} is VALID [2022-04-08 10:11:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:26,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:27,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {82949#false} assume !false; {82949#false} is VALID [2022-04-08 10:11:27,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {82949#false} assume 0 == ~cond; {82949#false} is VALID [2022-04-08 10:11:27,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {82949#false} ~cond := #in~cond; {82949#false} is VALID [2022-04-08 10:11:27,002 INFO L272 TraceCheckUtils]: 30: Hoare triple {82949#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82949#false} is VALID [2022-04-08 10:11:27,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {83092#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {82949#false} is VALID [2022-04-08 10:11:27,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {83096#(< 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; {83092#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:27,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {83100#(< 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; {83096#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:27,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {83104#(< 0 (mod (+ main_~z~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; {83100#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:27,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {83108#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {83104#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:27,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {83108#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {83108#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:27,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {83115#(< 0 (mod (+ main_~y~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; {83108#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:27,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {83119#(< 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; {83115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:27,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {83123#(< 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; {83119#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:27,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {83127#(< 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; {83123#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:27,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {83131#(< 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; {83127#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:27,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {83135#(< 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; {83131#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:27,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {83139#(< 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; {83135#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:27,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {83143#(< 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; {83139#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:27,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {83147#(< 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; {83143#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:27,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {83151#(< 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; {83147#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:27,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {83155#(< 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; {83151#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:27,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {83159#(< 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; {83155#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:27,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {83163#(< 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; {83159#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:27,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {83167#(< 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; {83163#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:27,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {83171#(< 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; {83167#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:27,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {83175#(< 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; {83171#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:27,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {83179#(< 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; {83175#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:27,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {83183#(< 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; {83179#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:27,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {82948#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83183#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:27,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {82948#true} call #t~ret9 := main(); {82948#true} is VALID [2022-04-08 10:11:27,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82948#true} {82948#true} #50#return; {82948#true} is VALID [2022-04-08 10:11:27,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {82948#true} assume true; {82948#true} is VALID [2022-04-08 10:11:27,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {82948#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); {82948#true} is VALID [2022-04-08 10:11:27,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {82948#true} call ULTIMATE.init(); {82948#true} is VALID [2022-04-08 10:11:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:27,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216852596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:27,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:27,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:11:27,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691602300] [2022-04-08 10:11:27,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691602300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:27,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:27,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:11:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996095776] [2022-04-08 10:11:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:27,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:27,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:27,038 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:11:27,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:11:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:27,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:11:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1972, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:11:27,039 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:33,924 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-04-08 10:11:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:11:33,924 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 89 transitions. [2022-04-08 10:11:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 89 transitions. [2022-04-08 10:11:33,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 89 transitions. [2022-04-08 10:11:33,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:33,990 INFO L225 Difference]: With dead ends: 128 [2022-04-08 10:11:33,991 INFO L226 Difference]: Without dead ends: 123 [2022-04-08 10:11:33,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1213, Invalid=4949, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 10:11:33,991 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:33,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 156 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:11:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-08 10:11:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 56. [2022-04-08 10:11:34,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:34,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:34,728 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:34,728 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:34,729 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-04-08 10:11:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-04-08 10:11:34,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:34,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:34,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 123 states. [2022-04-08 10:11:34,729 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 123 states. [2022-04-08 10:11:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:34,730 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-04-08 10:11:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-04-08 10:11:34,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:34,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:34,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:34,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:11:34,731 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:11:34,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:34,731 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:11:34,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:34,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:11:36,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-08 10:11:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:11:36,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:36,726 INFO L499 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:36,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:36,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-04-08 10:11:36,930 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:36,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1414069140, now seen corresponding path program 237 times [2022-04-08 10:11:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:36,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [522309709] [2022-04-08 10:11:36,934 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:36,934 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1414069140, now seen corresponding path program 238 times [2022-04-08 10:11:36,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:36,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771598797] [2022-04-08 10:11:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:37,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {83904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {83876#true} is VALID [2022-04-08 10:11:37,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {83876#true} assume true; {83876#true} is VALID [2022-04-08 10:11:37,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83876#true} {83876#true} #50#return; {83876#true} is VALID [2022-04-08 10:11:37,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {83876#true} call ULTIMATE.init(); {83904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:37,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {83904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.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); {83876#true} is VALID [2022-04-08 10:11:37,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {83876#true} assume true; {83876#true} is VALID [2022-04-08 10:11:37,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83876#true} {83876#true} #50#return; {83876#true} is VALID [2022-04-08 10:11:37,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {83876#true} call #t~ret9 := main(); {83876#true} is VALID [2022-04-08 10:11:37,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {83876#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83881#(= main_~y~0 0)} is VALID [2022-04-08 10:11:37,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {83881#(= 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; {83882#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:37,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {83882#(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; {83883#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:37,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {83883#(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; {83884#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:37,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {83884#(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; {83885#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:37,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {83885#(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; {83886#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:37,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {83886#(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; {83887#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:37,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {83887#(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; {83888#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:37,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {83888#(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; {83889#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:37,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {83889#(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; {83890#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:37,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {83890#(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; {83891#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:37,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {83891#(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; {83892#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:37,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {83892#(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; {83893#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {83893#(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; {83894#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:37,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {83894#(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; {83895#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:37,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {83895#(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; {83896#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:37,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {83896#(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; {83897#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:37,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {83897#(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; {83898#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:37,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {83898#(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; {83899#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:37,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {83899#(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; {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:37,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:37,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {83901#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:11:37,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {83901#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83902#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:11:37,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {83902#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83903#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:11:37,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {83903#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {83877#false} is VALID [2022-04-08 10:11:37,433 INFO L272 TraceCheckUtils]: 30: Hoare triple {83877#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83877#false} is VALID [2022-04-08 10:11:37,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {83877#false} ~cond := #in~cond; {83877#false} is VALID [2022-04-08 10:11:37,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {83877#false} assume 0 == ~cond; {83877#false} is VALID [2022-04-08 10:11:37,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {83877#false} assume !false; {83877#false} is VALID [2022-04-08 10:11:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:37,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771598797] [2022-04-08 10:11:37,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771598797] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:37,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080015802] [2022-04-08 10:11:37,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:11:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:37,435 INFO L229 MonitoredProcess]: Starting monitored process 140 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:37,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-04-08 10:11:37,472 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:11:37,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:37,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:11:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:37,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:37,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {83876#true} call ULTIMATE.init(); {83876#true} is VALID [2022-04-08 10:11:37,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {83876#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); {83876#true} is VALID [2022-04-08 10:11:37,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {83876#true} assume true; {83876#true} is VALID [2022-04-08 10:11:37,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83876#true} {83876#true} #50#return; {83876#true} is VALID [2022-04-08 10:11:37,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {83876#true} call #t~ret9 := main(); {83876#true} is VALID [2022-04-08 10:11:37,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {83876#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83881#(= main_~y~0 0)} is VALID [2022-04-08 10:11:37,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {83881#(= 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; {83882#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:37,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {83882#(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; {83883#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:37,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {83883#(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; {83884#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:37,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {83884#(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; {83885#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:37,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {83885#(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; {83886#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:37,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {83886#(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; {83887#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:37,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {83887#(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; {83888#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:37,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {83888#(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; {83889#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:37,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {83889#(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; {83890#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:37,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {83890#(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; {83891#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:37,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {83891#(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; {83892#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:37,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {83892#(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; {83893#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:37,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {83893#(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; {83894#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:37,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {83894#(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; {83895#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:37,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {83895#(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; {83896#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:37,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {83896#(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; {83897#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:37,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {83897#(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; {83898#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:37,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {83898#(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; {83899#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:37,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {83899#(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; {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:37,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:37,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {83900#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {83901#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:11:37,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {83901#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83902#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:11:37,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {83902#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83992#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:11:37,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {83992#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {83877#false} is VALID [2022-04-08 10:11:37,840 INFO L272 TraceCheckUtils]: 30: Hoare triple {83877#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83877#false} is VALID [2022-04-08 10:11:37,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {83877#false} ~cond := #in~cond; {83877#false} is VALID [2022-04-08 10:11:37,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {83877#false} assume 0 == ~cond; {83877#false} is VALID [2022-04-08 10:11:37,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {83877#false} assume !false; {83877#false} is VALID [2022-04-08 10:11:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:37,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:38,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {83877#false} assume !false; {83877#false} is VALID [2022-04-08 10:11:38,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {83877#false} assume 0 == ~cond; {83877#false} is VALID [2022-04-08 10:11:38,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {83877#false} ~cond := #in~cond; {83877#false} is VALID [2022-04-08 10:11:38,860 INFO L272 TraceCheckUtils]: 30: Hoare triple {83877#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83877#false} is VALID [2022-04-08 10:11:38,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {84020#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {83877#false} is VALID [2022-04-08 10:11:38,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {84024#(< 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; {84020#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:38,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {84028#(< 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; {84024#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:38,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {84032#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {84028#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:38,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {84032#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {84032#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:38,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {84039#(< 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; {84032#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:38,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {84043#(< 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; {84039#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:38,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {84047#(< 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; {84043#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:38,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {84051#(< 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; {84047#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:38,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {84055#(< 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; {84051#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:38,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {84059#(< 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; {84055#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:38,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {84063#(< 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; {84059#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:38,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {84067#(< 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; {84063#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:38,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {84071#(< 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; {84067#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:38,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {84075#(< 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; {84071#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:38,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {84079#(< 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; {84075#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:38,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {84083#(< 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; {84079#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:38,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {84087#(< 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; {84083#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:38,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {84091#(< 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; {84087#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:38,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {84095#(< 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; {84091#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:38,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {84099#(< 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; {84095#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:38,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {84103#(< 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; {84099#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:38,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {84107#(< 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; {84103#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:38,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {84111#(< 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; {84107#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:38,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {83876#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84111#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:11:38,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {83876#true} call #t~ret9 := main(); {83876#true} is VALID [2022-04-08 10:11:38,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83876#true} {83876#true} #50#return; {83876#true} is VALID [2022-04-08 10:11:38,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {83876#true} assume true; {83876#true} is VALID [2022-04-08 10:11:38,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {83876#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); {83876#true} is VALID [2022-04-08 10:11:38,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {83876#true} call ULTIMATE.init(); {83876#true} is VALID [2022-04-08 10:11:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:38,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080015802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:38,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:38,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:11:38,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:38,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [522309709] [2022-04-08 10:11:38,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [522309709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:38,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:38,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:11:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836924042] [2022-04-08 10:11:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:38,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:38,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:38,902 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:11:38,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:11:38,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:38,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:11:38,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=1941, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:11:38,904 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:45,075 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2022-04-08 10:11:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:11:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:11:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 91 transitions. [2022-04-08 10:11:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 91 transitions. [2022-04-08 10:11:45,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 91 transitions. [2022-04-08 10:11:45,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:45,130 INFO L225 Difference]: With dead ends: 132 [2022-04-08 10:11:45,137 INFO L226 Difference]: Without dead ends: 127 [2022-04-08 10:11:45,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1166, Invalid=4534, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:11:45,137 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:45,137 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 151 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:11:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-08 10:11:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 56. [2022-04-08 10:11:45,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:45,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,731 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,731 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:45,732 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2022-04-08 10:11:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2022-04-08 10:11:45,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:45,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:45,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 127 states. [2022-04-08 10:11:45,732 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 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 127 states. [2022-04-08 10:11:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:45,733 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2022-04-08 10:11:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2022-04-08 10:11:45,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:45,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:45,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:45,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call 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,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-04-08 10:11:45,734 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2022-04-08 10:11:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:45,734 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-04-08 10:11:45,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 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:45,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 67 transitions. [2022-04-08 10:11:46,088 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-04-08 10:11:46,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-04-08 10:11:46,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:46,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:46,304 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:680) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:483) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 30 more [2022-04-08 10:11:46,310 INFO L158 Benchmark]: Toolchain (without parser) took 616976.33ms. Allocated memory was 177.2MB in the beginning and 551.6MB in the end (delta: 374.3MB). Free memory was 126.7MB in the beginning and 189.3MB in the end (delta: -62.6MB). Peak memory consumption was 314.7MB. Max. memory is 8.0GB. [2022-04-08 10:11:46,310 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory was 142.9MB in the beginning and 142.8MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:11:46,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.40ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 126.5MB in the beginning and 189.6MB in the end (delta: -63.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-08 10:11:46,310 INFO L158 Benchmark]: Boogie Preprocessor took 33.92ms. Allocated memory is still 212.9MB. Free memory was 189.6MB in the beginning and 188.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 10:11:46,310 INFO L158 Benchmark]: RCFGBuilder took 239.69ms. Allocated memory is still 212.9MB. Free memory was 188.2MB in the beginning and 177.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 10:11:46,310 INFO L158 Benchmark]: TraceAbstraction took 616493.50ms. Allocated memory was 212.9MB in the beginning and 551.6MB in the end (delta: 338.7MB). Free memory was 176.2MB in the beginning and 189.3MB in the end (delta: -13.1MB). Peak memory consumption was 329.6MB. Max. memory is 8.0GB. [2022-04-08 10:11:46,311 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory was 142.9MB in the beginning and 142.8MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.40ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 126.5MB in the beginning and 189.6MB in the end (delta: -63.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.92ms. Allocated memory is still 212.9MB. Free memory was 189.6MB in the beginning and 188.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 239.69ms. Allocated memory is still 212.9MB. Free memory was 188.2MB in the beginning and 177.1MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 616493.50ms. Allocated memory was 212.9MB in the beginning and 551.6MB in the end (delta: 338.7MB). Free memory was 176.2MB in the beginning and 189.3MB in the end (delta: -13.1MB). Peak memory consumption was 329.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...